Powerful Number Checker

A number \(N\) is called a powerful number if for every prime number \(p\) that divides \(N\), \(p^2\) also divides \(N\). In other words, if \(p\) is a prime factor of \(N\), then the exponent of \(p\) in the prime factorization of \(N\) must be at least 2. Note that by convention, 1 is considered a powerful number.

Your task is to write a program that checks whether a given integer \(N\) is a powerful number.

For example:

• Input: 4 → Output: True (since \(4 = 2^2\))
• Input: 6 → Output: False (6 = 2 * 3, and neither 2 nor 3 appear with an exponent of 2)

inputFormat

The input consists of a single line containing an integer \(N\) where \(1 \leq N \leq 10^9\).

outputFormat

Output a single line containing either "True" if \(N\) is a powerful number, or "False" otherwise.

## sample

4

True

</p>