#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500010;
int n, cp, cur, np, ans[MAXN], vis[MAXN];
void del() {
  while (1) {
    while (np <= n && vis[np]) {
      np += cur;
    }
    if (np > n) {
      cur--;
      np = 2 * cur;
    } else {
      ans[cp--] = cur, vis[np] = 1;
      break;
    }
  }
  return;
}
int main() {
  scanf("%d", &n);
  cp = n, cur = n / 2, np = (n / 2) * 2;
  for (int i = 1; i <= n - 1; i++) {
    del();
  }
  for (int i = 2; i <= n; i++) {
    printf("%d ", ans[i]);
  }
  return 0;
}
