Java exam - 02.PythagoreanNumbers

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class _02_PythagoreanNumbers {

    public static void main(String[] args) {
        Set<String> ouput = new HashSet<String>();
        @SuppressWarnings("resource")
        Scanner input = new Scanner(System.in);
        int n = Integer.parseInt(input.nextLine());
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = input.nextInt();
        }

        boolean hasNumbers = false;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    if (
                         (arr[i]*arr[i] + arr[j]*arr[j]) == arr[k]*arr[k] &&
                         arr[i] <= arr[j] && arr[j] <= arr[k]   ) {
                        ouput.add(arr[i] + "*" + arr[i] + " + " + arr[j] + "*" + arr[j] + " = "
                                + arr[k] + "*" + arr[k]);
                        hasNumbers = true;
                    }
                }
            }
        }

        if (hasNumbers == false) {
            System.out.println("No");
        }
        else {
            for (String i : ouput) {
                System.out.println(i);
            }
        }

    }

}