#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N ;
  
  vector<int> A(N,1), P(N,-1);
  P[0] = 0;
  
  for (int i = 0; i < N; i++) {
    if (P[i] == 1) continue;
    else if (P[i] == -1) {
      for (int j = i; j < N; j += i+1) {
        P[j] = 1;
        A[j]++;
      }
      if (i <= 1000) {
        int i2 = (i+1)*(i+1);
        while(i2 <= N) {
          for (int j = i2; j <= N; j += i2) {
            A[j-1]++;
          }
          i2 *= (i+1);
        }
      }
    }
  }
  
  
  
  for (int i = 0; i < N; i++) {
    cout << A[i];
    if (i == N-1) cout << endl;
    else cout << " ";
  }
  
return 0;
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  int x;
  cin  >> x;
  if(x>=0) cout << x<< endl;
  else cout << 0<< endl;;
}
