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.*;
class Main
{
    public static void main (String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        a[0] = 11;
        int num = a[0];
        System.out.println(a[0] + " ");

        boolean bl;
        for(int i=1; i<n; i++){
            do{
                num += 10;
            }while(primJudge(num) == false);
            a[i] = num;
            System.out.println(a[i] + " ");   
        }
    }

    public static  boolean primJudge (int k){
        boolean bl = true;
        if( k==1 ) bl = false;
        if( k==2 ) bl = true;
        if( k>=3){
            for(int j=3; j*j<=k; j+=2){
                if(k % j == 0){
                    bl = false;
                    break;
                }
            }
        }
        return(bl);
    }
}