import math

N = int(1e6 + 10)
prime = [True] * N

def sieve():
    global prime
    prime[0] = prime[1] = False
    for i in range(2, int(math.sqrt(N - 5)) + 1):
        if prime[i]:
            for j in range(i * i, N - 5, i):
                prime[j] = False

def sum_of_digits(x):
    ans = 0
    while x:
        ans += x % 10
        x //= 10
    return ans

sieve()
n = int(input())
for i in range(2, n + 1):
    if prime[i] and prime[sum_of_digits(i)]:
        print(i, end=" ")

import sys
import math

def tcs(n):
    s = 0
    while n:
        s += n % 10
        n //= 10
    return s

def check(x):
    for i in range(2, int(math.sqrt(x)) + 1):
        if x % i == 0:
            return False
    return x > 1

n = int(sys.stdin.readline().strip())
for i in range(1, n + 1):
    if check(tcs(i)) and check(i):
        print(i, end=" ")