Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.

A number x is said to be a perfect square if there exists an integer y such that x = y2.

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.

The second line contains n integers a1, a2, ..., an ( - 106 ≤ ai ≤ 106) — the elements of the array.

It is guaranteed that at least one element of the array is not a perfect square.

Output

Print the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.

Examples

Input

2
4 2


Output

2


Input

8
1 2 4 8 16 32 64 576


Output

32

Note

In the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.

import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner input = new Scanner(System.in);
        int len = Integer.parseInt(input.nextLine());
        String[] arr = input.nextLine().split(" ");
        int[] arr1 = new int[len];
        for(int j = 0;j<len;j++){
         arr1[j] = Integer.parseInt(arr[j]);
        }
        Arrays.sort(arr1);
        for(int i=len-1;i>=0;i--) {
            if(!isSquare(arr1[i])){
                System.out.println(arr1[i]);
                break;
            }
        }



    }
    public static boolean isSquare(int n){
        double n1 = n + 0.0;
        if((int)Math.sqrt(n1) * (int)Math.sqrt(n1) == n){
            return true;
        }
        return false;
    }
}
