Print a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:

* a_i (1 \leq i \leq N) is a prime number at most 55 555.
* The values of a_1, a_2, ..., a_N are all different.
* In every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.



If there are multiple such sequences, printing any of them is accepted.

Constraints

* N is an integer between 5 and 55 (inclusive).

Input

Input is given from Standard Input in the following format:


N


Output

Print N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.

Examples

Input

5


Output

3 5 7 11 31


Input

6


Output

2 3 5 7 11 13


Input

8


Output

2 5 7 13 19 37 67 79
import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        boolean[] isNotPrime = new boolean[55555];
        int c = 2;
        isNotPrime[0] = true;
        isNotPrime[1] = true;
        while (c < isNotPrime.length){
            for (int k = c;k < isNotPrime.length;k += c){
                isNotPrime[k] = true;
            }
            isNotPrime[c] = false;
            ++c;
            if(c >= isNotPrime.length){
                break;
            }
            //System.out.println(c);
            while (isNotPrime[c]){
                ++c;
                if(c >= isNotPrime.length){
                    break;
                }
            }
        }
        int now[] = new int[n];
        now[0] = 2;
        int k = 1;
        for (int i = 1;i < n;++i){
            while (true){
                k += 2;
                if(!isNotPrime[k]){
                    now[i] = k;
                    break;
                }
            }
        }
        while (true){
            k += 2;
            if(!isNotPrime[k]){
                break;
            }
        }
        search(n,isNotPrime);
        //sout
    }


    public static void search(int n,boolean[] isNotPrime){
        int[] ret = new int[n];
        ret[0] = 2;
        ret[1] = 11;
        int last = 11;
        for (int i = 2;i < n;++i){
            while (true){
                last += 5;
                if(!isNotPrime[last]){
                    ret[i] = last;
                    break;
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0;i < ret.length;++i){
            sb.append(ret[i]);
            if(i + 1 != ret.length){
                sb.append(' ');
            }
        }
        System.out.println(sb.toString());
    }







}