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.*;
/**
 *
 * @author dip
 */
public final class Solution {
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int[] arr = new int[n];
        for(int arr_i=0; arr_i < arr.length; arr_i++){
            arr[arr_i] = in.nextInt();
        }
        int max=-10000000;
        double temp,temp2;
        for(int i=0; i < arr.length; i++){
            temp=Math.sqrt(arr[i]);
            temp2=(int)temp;
            if(temp!=temp2 && arr[i]>max){
                max=arr[i];
            }
        }
        System.out.println(max);
    }
}