Check for a Perfect Square

You are given an integer ( N ). Your task is to determine if ( N ) is a perfect square, i.e., if there exists an integer ( k ) such that ( k^2 = N ). Note that 0 and negative numbers are not considered perfect squares. The solution should read the input from standard input (stdin) and output the result to standard output (stdout).

inputFormat

A single integer ( N ) is provided via standard input.

outputFormat

Output a single line: either "Perfect Square" if ( N ) is a perfect square, or "Not a Perfect Square" otherwise.## sample

16

Perfect Square