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;
def ccheShu(n):
        b = n // 100;
        c = n // 10;
        return not suShu(n) and  not suShu(b) and not suShu(c)

for i in range (100, 1000):
        if ccheShu(i):
                print(i)

/**************************************************************
	Problem: 1143
	User: admin
	Language: Python
	Result: Accepted
	Time:49 ms
	Memory:34480 kb
****************************************************************/