Exam 2. Pythagorean Numbers

import java.util.Scanner;

public class _2_PythagoreanNumbers {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        int count = scan.nextInt();

        int[] numbers = new int[count];
        for (int i = 0; i < numbers.length; i++) {
            numbers[i] = scan.nextInt();
        }

        boolean isFoundPythagoreanNums = findAndPrintPythagoreanNumbers(numbers);

        if (!isFoundPythagoreanNums) {
            System.out.println("No");
        }
    }

    private static boolean findAndPrintPythagoreanNumbers(int[] nums) {
        boolean isFound = false;
        for (int numA : nums) {
            for (int numB : nums) {
                if (numA <= numB) {
                    for (int numC : nums) {
                        boolean isPythagoreanTriple = (numA * numA)
                                + (numB * numB) == numC * numC;

                        if (isPythagoreanTriple) {
                            isFound = true;
                            System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d%n",
                                    numA, numB, numC);
                        }
                    }
                }
            }
        }

        return isFound;
    }

}