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 test
{
 
 public static void main(String args[])
 {
  Scanner in =new Scanner(System.in);
  Stack<Integer> s = new Stack<Integer>();
  int n=in.nextInt();
  int[] arr=new int[n];
int i,j;

for(i=0;i<n;i++)
arr[i]=in.nextInt();
 
    for (i = 0; i < n-1; i++)
    {
      for ( j = 0; j < n-i-1; j++)
      {
        if (arr[j] > arr[j+1])
        {
          int temp = arr[j];
          arr[j] = arr[j+1];
          arr[j+1] = temp;
        }
      }
    }

    

for(i=0;i<n;i++)
  s.push(arr[i]);  

for(i=0;i<n;i++)
{
int y=s.pop();
 double x=Math.sqrt(y);
 
 
 
 if((x-Math.floor(x))!=0)
 {
 System.out.println(y); 
 System.exit(0); 
}

}
}

}