#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
  long long N; cin >> N;
  bool fire = false;
  map<int,int> X;
  for(int i = 1; i <= 312456; i++) {
    if(i % 3 == 1) {
      X[i] = 1;
    }
  }
  int x = 0;
  for(int i = 0; i < N - 2; i++){
    cout << 1 << " ";
    x += 1;
  }
  cout << 3 << " ";
  x += 3;
  int z = 0;
  for (const auto& [key, value] : X) {
    if(x < key) {
      z = key - x;
      break;
    }
  }
  cout << z << endl;
}