Perfect Square Checker

In this problem, you are given an integer ( n ) and you need to determine whether it is a perfect square. A number is a perfect square if it can be written in the form ( n = k^2 ), where ( k ) is an integer. Note that by definition, 0 and 1 are perfect squares, and negative numbers are not considered perfect squares. Use an efficient approach, such as binary search, to determine the answer.

inputFormat

The input consists of a single line containing one integer ( n ). The value of ( n ) can be negative, zero, or positive.

outputFormat

Output a single line: print True if ( n ) is a perfect square, otherwise print False.## sample

16

True