github.com/captn3m0/codechef.git

---
languages_supported:
    - NA
title: INSOMB1
category: NA
old_version: true
problem_code: INSOMB1
tags:
    - NA
layout: problem
---
###  All submissions for this problem are available. 

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

<pre>
<b>Input:</b>
2760727302517

<b>Output:</b>
PRIME
</pre>