Product of two primes

Write a program to tell if a given natural number is equal to the product of two different primes.

Input

Input consists of several cases, each with a natural number $n$ between 1 and $10^9$.

Output

For every $n$, tell if it can be obtained as the product of two different primes.

Observation

In this problem, you should not use vectors or alike.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T11:52:03.957Z

© Jutge.org, 2006–2026.
https://jutge.org