Given an array a₁, a₂, ..., a_n 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 = y².

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.

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.

Perfect Squares