Pythagorean Numbers

import java.util.ArrayList;
import java.util.Scanner;

public class PythagoreanNumbers {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        ArrayList<Integer> numbers = new ArrayList<>();
        for (int i = 0; i < n; i++){
            numbers.add(input.nextInt());
        }
        boolean found = false;
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++){
                for (int k = 0; k < n; k++){
                    int numOne = numbers.get(i);
                    int numTwo = numbers.get(j);
                    int numThree = numbers.get(k);
                    if (numOne <= numTwo && (numOne*numOne)+(numTwo*numTwo)==numThree*numThree){
                        System.out.printf("%d*%d + %d*%d = %d*%d\n",
                                numOne,numOne,numTwo,numTwo,numThree,numThree);
                        found = true;
                    }
                }
            }
        }
        if (found == false){
            System.out.println("No");
            return;
        }
    }
}