Multiplication Sign SoftUni

import java.lang.reflect.Method;
import java.util.Scanner;

public class MultiplicationSign {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = Integer.parseInt(scanner.nextLine());
        int num2 = Integer.parseInt(scanner.nextLine());
        int num3 = Integer.parseInt(scanner.nextLine());

        if (isZero(num1, num2, num3)) {
            System.out.println("zero");
        }
        else if (isNegative(num1, num2, num3)) {
            System.out.println("negative");
        }
        else if (isPositive(num1, num2, num3)) {
            System.out.println("positive");
        }

    }

    private static boolean isNegative(int num1, int num2, int num3) {
        int[] numbers = new int[]{num1, num2, num3};
        int countNegative = 0;
        for (int i = 0; i < numbers.length; i++) {
            if (numbers[i] < 0) {
                countNegative++;
            }
        }
        if (countNegative % 2 == 1) {
            return true;
        }
        return false;
    }

    private static boolean isZero(int num1, int num2, int num3) {
        int[] numbers = new int[]{num1, num2, num3};
        for (int i = 0; i < numbers.length; i++) {
            if (numbers[i] == 0) {
                return true;
            }
        }
        return false;
    }

    private static boolean isPositive(int num1, int num2, int num3) {
        int[] numbers = new int[]{num1, num2, num3};
        int countNegative = 0;
        for (int i = 0; i < numbers.length; i++) {
            if (numbers[i] < 0) {
                countNegative++;
            }
        }
        if (countNegative == 0 || countNegative == 2) {
            return true;
        }
        return false;
    }

}