CF914A.Perfect Squares

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

Given 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}$ .

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.

Print the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.

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$ .