#include <bits/stdc++.h>
using namespace std;
const int maxn = 500500;
int n, cnt;
int v[maxn], id[maxn];
int p[maxn], num[maxn];
void init(int n) {
  for (int i = 2; i <= n; ++i) {
    if (!v[i]) p[cnt++] = v[i] = i;
    for (int j = 0; j < cnt && i * p[j] <= n; ++j) {
      v[i * p[j]] = p[j];
      if (i % p[j] == 0) break;
    }
  }
}
int main() {
  scanf("%d", &n);
  init(n);
  num[1] = id[1] = 1;
  for (int i = 2; i <= n; ++i) num[i] = i / v[i], id[i] = i;
  sort(id + 1, id + n + 1, [](int x, int y) { return num[x] < num[y]; });
  for (int i = 2; i <= n; ++i) printf("%d%c", num[id[i]], " \n"[i == n]);
  return 0;
}
