#include <bits/stdc++.h>
using namespace std;
const long long N = 5e5;
long long smallestPrime[N + 1];
int main() {
  long long n;
  scanf("%lld", &(n));
  for (long long i = 2; i <= n; i++) {
    if (smallestPrime[i]) {
      continue;
    }
    smallestPrime[i] = 1;
    for (long long j = i * i; j <= n; j += i) {
      if (smallestPrime[j]) {
        continue;
      }
      smallestPrime[j] = j / i;
    }
  }
  sort(smallestPrime + 2, smallestPrime + n + 1);
  for (long long i = 2; i <= n; i++) {
    printf("%lld ", smallestPrime[i]);
  }
}
