import math
def suShu(n):
        f = True
        for i in range (2 , int(math.sqrt(n))+1):
                if n % i == 0:
                        f = False
                        break;
        return f and n != 1
def hwsuShu(n):
        a = n // 100 % 10
        b = n // 10 % 10
        c = n % 10
        if n < 100:
             return  b == c and  suShu(n);
        elif n > 100:
             return  a == c and  suShu(n);
        else:
             return False
for i in range (10, 1000):
        if hwsuShu(i):
                print(i)

/**************************************************************
	Problem: 1142
	User: admin
	Language: Python
	Result: Accepted
	Time:44 ms
	Memory:34480 kb
****************************************************************/