#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#include <fstream>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int,int>
#define MA make_pair
#define LL long long
#define LI long int
#define LLI long long int
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define POS(i) cout<<(i?"POSSIBLE":"IMPOSSIBLE")<<endl
using namespace std;
//
const int INF=1e9+7;
const int LINF=1e18;
const int MOD=1e9+7;
//
int main(){
int n; cin>>n;
int k=n%8;
int d[8][4]={{1,1,1,1},{1,0,1,0},{1,0,1,0},{0,0,1,1},{0,1,1,0},{0,1,1,1},{1,1,1,0},{1,1,1,0}};
//int a[8]={0,2,2,2,1,1,1,1};
//n-=a[k];
int s[4]={2,3,4,6};
int p=0;
if(n==3){
cout<<"2 5 63";
exit(0);
}
FOR(i,0,4){
if(d[k][i]){
cout<<s[i]<<" ";
p++;
}
}
FOR(i,0,n/4+1){
FOR(j,0,4){
if(p>=n){
break;
}else{
p++;
cout<<s[j]+6*(i+1)<<" ";
}
}
}
return 0;
}