import math def is_prime(n): flag = True for i in range(2, int(round(math.sqrt(n))) + 1): if n % i == 0: flag = False break if flag: return 'prime' else: return 'not prime' s = is_prime(int(input())) print(s+'\n')