Problem: We'll call a set of positive integers a beautiful if the following condition fulfills: for any prime p, if <image>, then <image>. In other words, if one number from the set is divisible by prime p, then at least half of numbers from the set is divisible by p.

Your task is to find any beautiful set, where the number of elements is equal to k and each element doesn't exceed 2k2.

Input

The first line contains integer k (10 ≤ k ≤ 5000) that shows how many numbers the required beautiful set should have.

Output

In the first line print k space-separated integers that are a beautiful set. If there are multiple such sets, you are allowed to print any of them.

Examples

Input

10


Output

16 18 24 27 36 48 54 72 108 144 

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.geom.*;

import static java.lang.Math.*;

public class Solution implements Runnable {

	final int PRIMECNT = 20;
	
	int[] primes = new int[PRIMECNT];
	int k;
	
	boolean isPrime(int n) {
		for (int i = 2; i * i <= n; i++) {
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}
	
	PriorityQueue<Integer>[] heap = new PriorityQueue[1 << PRIMECNT];
	
	void gen(int mask, int curp, int curval) {
		if (curp >= PRIMECNT) { 
			heap[mask].add(curval);
		} else {
			if ((mask & (1 << curp)) == 0) {
				gen(mask, curp + 1, curval);
			} else {
				curval *= primes[curp];
				while (curval <= 2 * k * k) {
					gen(mask, curp + 1, curval);
					curval *= primes[curp];
				}
			}
		}
	}
	
	boolean check(ArrayList<Integer> ans, int primecnt) {
		if (ans.size() < k){ 
			return false;
		}
		int[] cnt = new int[primecnt];
		for (int i = 0; i < k; i++) {
			for (int j = 0; j < primecnt; j++) {
				if (ans.get(i) % primes[j] == 0) {
					cnt[j]++;
				}
			}
		}
		for (int i = 0; i < primecnt; i++) {
			if (cnt[i] * 2 < k) {
				return false;
			}
		}
		return true;
	}
	
	ArrayList<Integer> trySolve(int primecnt) {
		for (int mask = 0; mask < (1 << primecnt); mask++) {
			heap[mask] = new PriorityQueue<>();
			gen(mask, 0, 1);
		}
		ArrayList<Integer> ans = new ArrayList<>();
		int STARTBITCOUNT = primecnt;
	oouter:
		for (int bitcount = STARTBITCOUNT; bitcount >= 1; bitcount--) {
			ArrayList<PriorityQueue<Integer>> good = new ArrayList<>();
			for (int mask = 0; mask < (1 << STARTBITCOUNT); mask++) {
				if (Integer.bitCount(mask) == bitcount) {
					good.add(heap[mask]);
				}
			}
		outer:
			while (true) {
				ArrayList<Integer> cans = new ArrayList<>();
				for (int i = 0; i < good.size(); i++) {
					if (good.get(i).size() == 0) {
						//break outer;
						continue;
					}
					cans.add(good.get(i).poll());
				}
				if (cans.size() == 0) {
					break;
				}
				for (int i = 0; i < cans.size() && ans.size() < k; i++) {
					ans.add(cans.get(i));
				}
			}
		}
		if (check(ans, primecnt)) {
			return ans;
		} else {
			return null;
		}
	}
	
	public void solve() throws Exception {
		k = sc.nextInt();
		int cnt = 0;
		for (int i = 2; cnt < PRIMECNT; i++) {
			if (isPrime(i)) {
				primes[cnt++] = i;
			}
		}
		int curcnt = 2;
		ArrayList<Integer> ans;
		while ((ans = trySolve(curcnt)) == null) {
			//out.println(curcnt);
			//out.flush();
			curcnt++;
		}
		//out.println(ans.size() + " " + check(ans, 2));
		for (int i = 0; i < ans.size(); i++) {
			out.print(ans.get(i) + " ");
		}
		out.println();
		//out.println(check(ans, curcnt));
	}
	
	final String filename = "";

	static Throwable uncaught;

	BufferedReader in;
	FastScanner sc;
	PrintWriter out;

	@Override
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			//in = new BufferedReader(new FileReader(filename + ".in"));
			//out = new PrintWriter(new FileWriter(filename + ".out"));
			sc = new FastScanner(in);
			solve();
		} catch (Throwable uncaught) {
			Solution.uncaught = uncaught;
		} finally {
			out.close();
		}
	}

	public static void main(String[] args) throws Throwable {
		Thread thread = new Thread(null, new Solution(), "", (1 << 26));
		thread.start();
		thread.join();
		if (Solution.uncaught != null) {
			throw Solution.uncaught;
		}
	}

}

class FastScanner {

	BufferedReader in;
	StringTokenizer st;

	public FastScanner(BufferedReader in) {
		this.in = in;
	}

	public String nextToken() throws Exception {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(in.readLine());
		}
		return st.nextToken();
	}

	public int nextInt() throws Exception {
		return Integer.parseInt(nextToken());
	}

	public long nextLong() throws Exception {
		return Long.parseLong(nextToken());
	}

	public double nextDouble() throws Exception {
		return Double.parseDouble(nextToken());
	}

}