var
a: int64;
ans: boolean;
function is_prime(a: int64): boolean;
var
i: int64;
begin
is_prime := true;
i := 2;
while (i * i <= a) do<br> if (a mod i = 0) then begin
is_prime := false;
exit;
end else
i := i + 1;
end;
begin
readln(a);
ans := is_prime(a);
if ans then
writeln('prime')
else
writeln('composite');
end.