import java.util.Scanner;

public class Antiprime {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int count = 0;
        int num = 2;
        while (count < n) {
            if (isAntiPrime(num)) {
                System.out.print(num + " ");
                count++;
                if (count % 10 == 0) {
                    System.out.println();
                }
            }
            num++;
        }
    }

    // 判断一个数是否为反素数
    public static boolean isAntiPrime(int num) {
        if (isPrime(num)) {
            int reverseNum = reverseNumber(num);
            return isPrime(reverseNum) && num != reverseNum;
        }
        return false;
    }

    // 判断一个数是否为素数
    public static boolean isPrime(int num) {
        if (num <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }

    // 倒置一个整数
    public static int reverseNumber(int num) {
        int reverseNum = 0;
        while (num != 0) {
            int digit = num % 10;
            reverseNum = reverseNum * 10 + digit;
            num = num / 10;
        }
        return reverseNum;
    }
}