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.*;
public class PerfectSquare {
	
	public static boolean square(int a){
		double b=Math.sqrt(a);
		int c=(int)b;
		if((c-b)==0){
			return true;
		}
		return false;
	}
	
	public static void main(String args[]){
		Scanner in =new Scanner(System.in);
		String p=in.nextLine();
		int q=Integer.parseInt(p);
		String r=in.nextLine();
		String s[] = r.split("\\s+");
		int arr[] = new int[q];
		int max = -1000001;
		for(int i=0;i<q;i++){
			arr[i] = Integer.parseInt(s[i]);
			if(arr[i]>=0){
				if(!square(arr[i])){
					if(arr[i]>max){
						max=arr[i];
					}
				}
			}else{
				if(arr[i]>max){
					max=arr[i];
				}
			}
		}
		System.out.println(max);
		in.close();
	}
}