def isprime(n):
 return all(map(lambda divisor: n%divisor!=0,range(2,int(n**.5)+1)))

T=[isprime(i) for i in range(64)]
def gen(s=""):
 if len(s)==0:
  for i in range(1,10):
   s=str(i)
   yield from gen(s)

 elif len(s)==7:
  if T[sum(map(int,s))]: yield int(s)
 else:
  for i in range(int(s[-1]),10):
   t=s+str(i)
   yield from gen(t)
c=0
for v in gen():
 if isprime(v): print(v)