#include <bits/stdc++.h>
using namespace std;
int isPrime(int n) {
  float n_sqrt;
  if (n == 2 || n == 3) return 1;
  if (n % 6 != 1 && n % 6 != 5) return 0;
  n_sqrt = floor(sqrt((float)n));
  for (int i = 5; i <= n_sqrt; i += 6) {
    if (n % (i) == 0 | n % (i + 2) == 0) return 0;
  }
  return 1;
}
int mapp[100010];
int main() {
  int cnt = 2;
  int n;
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    if (i % 2 == 0) {
      mapp[i] = 1;
    } else if (isPrime(i)) {
      mapp[i] = cnt;
      for (int j = 1; j * i <= n; j++) {
        mapp[i * j] = cnt;
      }
      cnt++;
    }
  }
  for (int i = 2; i < n; i++) {
    printf("%d ", mapp[i]);
  }
  printf("%d", mapp[n]);
  return 0;
}
