import math #判断素数 def isprime(n): if n == 1 or n == 0: return False for i in range(2,int(math.sqrt(n))): #循环上限不用到n,到sqrt(n)即可,否则容易超时 if n%i == 0: return False break return True n = input() re_n = n[::-1] #reverse x = n + re_n[1:] #拼凑回文数字符串 if isprime(int(x)): print("prime") else: print("noprime")