#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int inf = (1 << 30) - 1;
const int N = (int)2e5 + 5;
int n;
bool isSquare(int x) {
  for (int i = 0; i <= 1000; i++) {
    if (i * i == x) return true;
  }
  return false;
}
int main() {
  scanf("%d", &n);
  int ans = -inf;
  for (int i = 1, x; i <= n; i++) {
    cin >> x;
    if (!isSquare(x)) {
      ans = max(ans, x);
    }
  }
  cout << ans << "\n";
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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 int mod = (int)1e9 + 7;
const int inf = (1 << 30) - 1;
const int N = (int)2e5 + 5;
int n;
bool isSquare(int x) {
  for (int i = 0; i <= 1000; i++) {
    if (i * i == x) return true;
  }
  return false;
}
int main() {
  scanf("%d", &n);
  int ans = -inf;
  for (int i = 1, x; i <= n; i++) {
    cin >> x;
    if (!isSquare(x)) {
      ans = max(ans, x);
    }
  }
  cout << ans << "\n";
  return 0;
}

```