#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int INF=1e9;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;

  if(N==1){
    cout<<2*INF<<" "<<2<<" "<<2*INF<<endl;
    return 0;
  }

  vector<int> ans(N+2,0);
  ans[0]=2*INF;
  ans[N+1]=2*INF;

  for(int i=2;i<=N;i++) ans[i]=i;
  ans[1]=N;

  cout<<ans[0];
  for(int i=1;i<ans.size();i++) cout<<" "<<ans[i];
  cout<<endl;

  return 0;
}