Perfect Squares

Description:

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 a₁, a₂, ..., a_n ( - 10⁶ ≤ a_i ≤ 10⁶) — 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.

Sample Input:

2
4 2

Sample Output:

2

Sample Input:

8
1 2 4 8 16 32 64 576

Sample 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.