#include <bits/stdc++.h>
using namespace std;
int prime[500011], tot;
bool p[500011];
int ans[500011];
int n;
int read() {
  int _ = 0, __ = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') __ = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    _ = _ * 10 + ch - '0';
    ch = getchar();
  }
  return _ * __;
}
void xs(int s) {
  p[0] = true;
  p[1] = true;
  ans[1] = 1;
  for (int i = 2; i <= s; i++) {
    if (p[i] == false) prime[++tot] = i, ans[i] = 1;
    for (int j = 1; j <= tot; j++) {
      if (i * prime[j] > s) break;
      p[i * prime[j]] = true;
      ans[i * prime[j]] = max(i, prime[j]);
      if (i % prime[j] == 0) break;
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n;
  xs(n);
  sort(ans + 1, ans + n + 1);
  cout << ans[2];
  for (int i = 3; i <= n; i++) cout << " " << ans[i];
  cout << endl;
  return 0;
}
