class Solution {
public long solution(long n) {
long answer = n;
if(Math.sqrt(n) % 1 == 0)
answer = (long)((Math.sqrt(n)+1)*(Math.sqrt(n)+1));
else
answer = -1;
return answer;
}
}
class Solution {
public long solution(long n) {
if (Math.pow((int)Math.sqrt(n), 2) == n) {
return (long) Math.pow(Math.sqrt(n) + 1, 2);
}
return -1;
}
}