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.
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, mx = 0, mx2;
  bool flag = false, f2 = false;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a < 0) {
      if (!f2)
        f2 = true, mx2 = a;
      else
        mx2 = max(a, mx2);
    } else {
      double temp = sqrt(a), t2 = ceil(sqrt(a));
      if (t2 != temp && a >= mx) mx = a, flag = true;
    }
  }
  if (flag)
    cout << mx << endl;
  else
    cout << mx2 << endl;
  return 0;
}
