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.
def isp(n):
    if n<0:
        return False
    c=n**0.5
    if c%1==0:
        return True
    else:
        return False
n=int(input())
s=input()
a=s.split()
for i in range(len(a)):
    a[i]=int(a[i])
'''j=0    
while True:
    if isp(a[j])==False:
        c=a[j]
        break
    j+=1
for i in range(len(a)):
    if a[i]>c and isp(a[i])==False:
        c=a[i]
print(c)       '''
while isp(max(a))==True:
    x=a.index(max(a))
    del(a[x])
print(max(a))
