#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(long long n){
	if(n % 2 == 0){
		if(n == 2)
			return 1;
		else
			return 0;
	}else{
		for(int i = 3; i*i <= n; ++i){
			if(n % i == 0)
				return 0;
		}
		return 1;
	}
}
int main(){
	long long n;
	cin >> n;
	if(isPrime(n))
		cout << "prime";
	else
		cout << "composite";
}