Pythagorean Numbers

import java.util.Scanner;


public class PythagoreanNumbers {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        int numbersCount = Integer.parseInt(input.nextLine());
        int[] numbersArr = new int[numbersCount];

        for (int i = 0; i < numbersCount; i++) {
            numbersArr[i] = Integer.parseInt(input.nextLine());
        }

        boolean equationFound = false;

        for (int i = 0; i < numbersArr.length; i++) {
            for (int j = 0; j < numbersArr.length; j++) {
                for (int k = 0; k < numbersArr.length; k++) {
                    int firstNum = numbersArr[i];
                    int secondNum = numbersArr[j];
                    int thirdNum = numbersArr[k];

                    if (firstNum <= secondNum) {
                        if ((firstNum * firstNum) + (secondNum * secondNum) == (thirdNum * thirdNum)) {
                            System.out.printf("%1$d*%1$d + %2$d*%2$d = %3$d*%3$d",
                                    firstNum, secondNum, thirdNum);
                            System.out.println();
                            equationFound = true;
                        }
                    }
                }
            }
        }

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

    }

}