Modern cryptosystems rely heavily on our inability to factor large integers quickly as the basis for their security. They need a quick and easy way to generate and test for primes. Very often, the primes generated are very large numbers. You need to implement ways to test the primality of very large numbers.

Input
Line 1: A number (no more than 1000 digits long)

Output
Line 1: PRIME or COMPOSITE

Example

Input:
2760727302517

Output:
PRIME

见题面

见题面