#K39382. Perfect Square Checker

    ID: 26408 Type: Default 1000ms 256MiB

Perfect Square Checker

Perfect Square Checker

Given a non-negative integer \(n\), determine whether it is a perfect square. A perfect square is defined as an integer \(n\) for which there exists an integer \(k\) such that \(n = k^2\). For example, \(0 = 0^2\) and \(1 = 1^2\) are perfect squares. Your task is to read an integer from standard input and print Perfect Square if it is a perfect square; otherwise, print Not!!.

inputFormat

The input consists of a single line containing one non-negative integer \(n\) (\(0 \le n \le 10^9\)).

outputFormat

Output a single line: Perfect Square if \(n\) is a perfect square, or Not!! if it is not.

## sample
25
Perfect Square