#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <algorithm>

#define REP(i, n) for(ll i = 0; i < (n); i++)
#define INF 1e16
#define MOD 1e9 + 7

using namespace std;
using ll = long long;



int main() {
	ll n;
	cin >> n;
	vector<ll> ans(n, 1);
	ans[0] = 3;
	if ((n + 2) % 3 == 0) {
		ans[2] = ans[1] = 3;
	}
	else if ((n + 2) % 3 == 2) {
		ans[1] = 3;
	}
	REP(i, n) {
		cout << ans[i] << " \n"[i == n - 1];
	}
}