#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<int> max_div(n + 1);
  max_div[1] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = i * 2; j <= n; j += i) max_div[j] = i;
  }
  sort(max_div.begin(), max_div.end());
  for (int i = 2; i <= n; i++) cout << max_div[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
