Rating changes for last rounds are temporarily rolled back. They will be returned soon.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Perfect Squares

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputGiven an array *a*_{1}, *a*_{2}, ..., *a*_{n} 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* = *y*^{2}.

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 *a*_{1}, *a*_{2}, ..., *a*_{n} ( - 10^{6} ≤ *a*_{i} ≤ 10^{6}) — 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.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/20/2022 22:50:04 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|