#include <bits/stdc++.h>
using namespace std;
const long long SIZE = (long long)1e5;
const long long INF = (long long)1e9 + 7;
int main() {
  int n, A[1000];
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  sort(A, A + n);
  for (int i = n - 1; i >= 0; i--) {
    if (A[i] < 0) {
      cout << A[i];
      break;
    } else {
      if (!(sqrt(A[i]) - floor(sqrt(A[i])) <= 1e-8)) {
        cout << A[i];
        break;
      }
    }
  }
  return 0;
}

### Prompt

Generate a CPP solution to the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long SIZE = (long long)1e5;
const long long INF = (long long)1e9 + 7;
int main() {
  int n, A[1000];
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  sort(A, A + n);
  for (int i = n - 1; i >= 0; i--) {
    if (A[i] < 0) {
      cout << A[i];
      break;
    } else {
      if (!(sqrt(A[i]) - floor(sqrt(A[i])) <= 1e-8)) {
        cout << A[i];
        break;
      }
    }
  }
  return 0;
}

```