#include <bits/stdc++.h>
#define rep(i, n) for (long long  i = 0; i < (long long )(n); i++)
#define all(x) (x).begin(),(x).end()
#define fix(x) fixed << setprecision(x)
#define eb emplace_back
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vs = vector<string>;
using pl = pair<long long, long long>;
template <typename t> inline bool chmin(t& a, const t& b) {bool compare = a > b; if (a > b) a = b; return compare;}
template <typename t> inline bool chmax(t& a, const t& b) {bool compare = a < b; if (a < b) a = b; return compare;}
template<class t>using rp_queue=priority_queue<t,vector<t>,greater<t>>;
void fast_io(){cin.tie(nullptr);ios_base::sync_with_stdio(false);}
template <typename t> t gcd(t a, t b) {if (b == 0)return a; else return gcd(b, a % b);}
template <typename t> inline t lcm(t a, t b) {return a /gcd(a, b)*b;}
const ll inf = 1ll << 60;
const ld pi = 3.14159265358979323846l;
void solve(){
  ll N;cin>>N;
  //条件を言い換えると
  //3で割ったあまりが１である->全ての総和を３の倍数にして１足す
  //全てを足した値が312456以下となるようにする。
  cout<<3<<" ";
  if((N-1)%3==0)cout<<2<<" ";
  if((N-1)%3==1)cout<<1<<" ";
  if((N-1)%3==2)cout<<3<<" ";
  rep(i,N-2)cout<<1<<" ";
  cout<<endl;
}
int main(){
  fast_io();
  int num_tc = 1;
  //cin >> num_tc;
  rep(tc,num_tc){
    //cout << "case #" << tc+1 << ": " ;// << endl;
    solve();
  }
}