Special Number Divisor Check

You are given a positive integer n. A number is considered special if it has exactly three distinct natural number divisors. It can be shown mathematically that a number n has exactly three divisors if and only if n = p^2, where p is a prime number. For example, 4 (since 4 = 2² and 2 is prime) has exactly three divisors: 1, 2, and 4.

Your task is to determine whether the given number is special. Use the formula below:

If the condition holds, output True; otherwise, output False.

inputFormat

The input consists of a single line containing an integer n (1 ≤ n ≤ 10¹²).

outputFormat

Output a single line: True if n is a special number with exactly three distinct natural number divisors, and False otherwise.

4

True