#include <bits/stdc++.h>
using namespace std;
int pow(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    x = (x * x);
    y = y >> 1;
  }
  return res;
}
int n, k;
int maxm(string s) {
  vector<int> cnt(n);
  int idx = 0, sum = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'L') {
      sum += i - idx;
      idx++;
    }
  }
  return sum;
}
int maxPairs(string s) {
  int cnt = 0;
  for (int i = 0; i < n - 1; ++i) {
    if (s[i] == 'R' && s[i + 1] == 'L') cnt++;
  }
  return cnt;
}
int minm(string s) {
  int cnt = maxm(s);
  int ans = 0;
  while (cnt) {
    for (int i = 0; i < n - 1; ++i) {
      if (s[i] == 'R' && s[i + 1] == 'L') {
        s[i] = 'L';
        s[i + 1] = 'R';
        i++;
        cnt--;
      }
    }
    ans++;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<int> d(n + 1, -1);
  d[1] = 1;
  for (int i = 2; i <= n; ++i) {
    if (d[i] == -1) {
      d[i] = 1;
      for (int j = i * i; j <= n; j += i) {
        if (j % i == 0 && d[j] == -1) d[j] = j / i;
      }
    }
  }
  sort(d.begin(), d.end());
  for (int i = 2; i <= n; ++i) {
    cout << d[i] << " ";
  }
  cout << "\n";
}
