#!/usr/bin/python3

def isPrime(n):
    if n < 2: return False
    elif n == 2: return True
    elif n % 2 == 0: return False

    i = 3
    while i*i <= n:
        if n % i == 0: return False
        i += 2
    return True

n = int(input())

if isPrime(n):
    print('prime')
else:
    print('composite')