Perfect Square Checker

Given an integer \( N \), determine whether it is a perfect square. A number is considered a perfect square if there exists an integer \( k \) such that \( k^2 = N \). For example, \(16\) is a perfect square because \(4^2 = 16\), whereas \(20\) is not.

Your task is to implement a function that checks if \( N \) is a perfect square. The answer should print True if \( N \) is a perfect square, and False otherwise.

Note: Use the \( \LaTeX \) format for any formulas in the description.

inputFormat

The input consists of a single integer \( N \) provided via standard input.

Example:

16

outputFormat

The output is a single line containing either True or False on standard output, depending on whether \( N \) is a perfect square.

Example:

True

## sample

16

True