Sum of Two Distinct Primes

Given an integer \( n \), determine whether it can be expressed as the sum of exactly two distinct prime numbers. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

You are required to read the input from standard input (stdin) and print the result to standard output (stdout). The output should be True if \( n = p + q \) for two distinct prime numbers \( p \) and \( q \); otherwise, output False.

Note: The two prime numbers must be different. For example, even though 4 can be written as 2 + 2, this does not count.

Examples:

• Input: 10 → Output: True (because 10 = 3 + 7)
• Input: 11 → Output: False

inputFormat

The input consists of a single integer \( n \) (\( 1 \leq n \leq 10^6 \)). The integer is provided via standard input.

outputFormat

Output a single line containing True if \( n \) can be expressed as the sum of two distinct prime numbers, otherwise output False.

10

True