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.*;

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner scanner = new Scanner(System.in);
        int N=scanner.nextInt();
        final int MAX=55555;
        boolean[] isPrime =new boolean[MAX];
        for(int i=0;i<MAX;i++){
            isPrime[i]=true;
        }
        for(int i=2;i<240;i++){
            if(isPrime[i-1]==false) continue;
            for(int j=0;j<MAX/i;j++){
                if(j>0){
                    isPrime[i*(j+1)-1]=false;
                }
            }
        }
        int[] results=new int[N];
        int index=0;
        for(int i=1;i<MAX;i++){
            if((i+1)%5==1){
                if(isPrime[i]){
                    results[index]=i+1;
                    index++;
            if(index==N){
                break;
            }
                }
                
            
            }
        }
        for(int i=0;i<N-1;i++){
            System.out.print(results[i]+" ");
        }
        System.out.println(results[N-1]);
        
    }
}
