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;
bool Check(int n) {
  if (n == 0) {
    return true;
  }
  for (int i = 1; i * i <= n; i++) {
    if (i * i == n) {
      return true;
    }
  }
  return false;
}
int main() {
  int n;
  int temp, max;
  cin >> n;
  bool first = true;
  for (int i = 0; i < n; i++) {
    cin >> temp;
    if (Check(temp) == false) {
      if (first) {
        max = temp;
        first = false;
        continue;
      }
      if (max < temp) {
        max = temp;
      }
    }
  }
  cout << max;
  return 0;
}
