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 math
q = []
qq = []
p = []
x = []
xx = []
n = int(input())
a = input()
s = a.split()
for i in range(len(s)):
    s[i] = int(s[i])
    if s[i] >= 0:
        p.append(s[i])
    else:
        q.append(s[i])
for i in range(len(p)):
    r = math.sqrt(p[i])
    if r != int(r):
        x.append(p[i])
if len(q) > 0:
    n = max(q)
    if len(x) > 0:
        m = max(x)
        if m > n:
            print(m)
        if n > m:
            print(n)
    else:
        print(n)
else:
    m = max(x)
    print(m)
