def findDigit(n):
    counter = 0
    while(n>0):
        counter += 1
        n = n//10
    return counter

def isPrime(x):
    for i in range(2, (x//2)+1):
        if (x % i) == 0:
            return False
            break
    else:
        return True
    
def calculate():
    values = []
    x = 0
    while True:
        x+=1
        if findDigit(x) > 3:
            break
        if findDigit(x) != 3 or x//100 != 5:
            continue
        if isPrime(x):
            values.append(x)
    return values

def main():
  values = calculate()
  for i in values:
    print(i)

main()