#include <bits/stdc++.h>
using namespace std;
int p[500005];
vector<int> v[500005];
int ans[500005];
int main() {
  int n, pos;
  scanf("%d", &n);
  p[1] = 1;
  v[1].push_back(1);
  for (int i = 2; i <= n; i++)
    for (int j = i; j <= n; j += i)
      if (!p[j]) {
        p[j] = i;
        v[i].push_back(j);
      }
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < v[i].size(); j++) ans[v[i][j] / i]++;
  for (int i = 1; i <= n; i++) ans[i] += ans[i - 1];
  pos = 1;
  for (int i = 2; i <= n; i++) {
    while (ans[pos] < i) pos++;
    if (i != n)
      printf("%d ", pos);
    else
      printf("%d\n", pos);
  }
  return 0;
}
