#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
bool prime(long long n){
	for(long long i=2;i*i<=n;i++){
		if(n%i==0)return false;
	}
	return true;
}
long long get(long long n){
	for(long long i=n;true;i++){
		if(prime(i))return i;
	}
}

int main(){
	
	long long n;
	cin>>n;
	vector<long long> ans(n);
	rep(i,n){
		ans[i] = 1LL<<(i);
	}
	
	long long cur = 90000000;
	for(int i=0;i<n;i++){
		cur = get(cur);
		ans[i] *= cur;
		cur--;
		cur /= 2;
		
	}
	/*
	rep(i,n-1){
		cout<<lcm(ans[i],ans[i+1])<<endl;
	}*/
	
	rep(i,n){
		if(i!=0)cout<<' ';
		cout<<ans[i];
	}
	cout<<endl;
		
	return 0;
}