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.*;
import java.io.*;
 
public class Main{
    public static void main(String[] args){
        Main m = new Main();
        m.input();
    }
 
    public void input(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.close();
        ArrayList<Integer> li = primeSet();
        for(int j = 0; j < n; j++){
            System.out.print(li.get(j));
            if(j == n - 1){
                break;
            }
            System.out.print(" ");
        }
        System.out.println();
        
    }

    public ArrayList<Integer> primeSet(){
        ArrayList<Integer> pli = new ArrayList<Integer>();
        ArrayList<Integer> li = new ArrayList<Integer>();
        pli.add(2);
        
        for(int i = 3; i <= 10000; i = i + 2){
            boolean check = true;
            for(int j = 0; j < pli.size(); j++){
                if(i % pli.get(j) == 0){
                    check = false;
                    break;
                }
            }
            if(check){
                pli.add(i);
                if(i % 20 == 1){
                    li.add(i);
                }
            }
        }

        return li;
    }
    
}