#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
bool Check(int x) {
  if (x < 0) return false;
  int t = int(sqrt(x));
  for (int k = -3; k <= 3; ++k)
    if ((t + k) * (t + k) == x) return true;
  return false;
}
int main() {
  int n = read(), ans = -1e9, x;
  for (int i = 1; i <= n; ++i)
    if (x = read(), !Check(x)) ans = max(ans, x);
  cout << ans;
  return 0;
}

### Prompt

Your task is to create 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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
bool Check(int x) {
  if (x < 0) return false;
  int t = int(sqrt(x));
  for (int k = -3; k <= 3; ++k)
    if ((t + k) * (t + k) == x) return true;
  return false;
}
int main() {
  int n = read(), ans = -1e9, x;
  for (int i = 1; i <= n; ++i)
    if (x = read(), !Check(x)) ans = max(ans, x);
  cout << ans;
  return 0;
}

```