#include <bits/stdc++.h>
using namespace std;
const int M = 5e5 + 5;
int n, mx[M];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i)
    for (int j = i << 1; j <= n; j += i) mx[j] = i;
  sort(mx + 1, mx + n + 1);
  for (int i = 2; i <= n; ++i) printf("%d ", mx[i]);
  return 0;
}
