#include <bits/stdc++.h>
using namespace std;
int on[100005];
int prime[100005], cnt = 0;
void ola() {
  for (int i = 2; i <= 100005; i++) {
    if (!on[i]) prime[cnt++] = i;
    for (int j = 0; j < cnt && i * prime[j] <= 100005; j++) {
      on[i * prime[j]] = 1;
      if (i % prime[j] == 0) break;
    }
  }
}
int main() {
  int n, flag = 0;
  cin >> n;
  ola();
  for (int i = 2; i <= n + 1; i++) {
    if (on[i] == 1) {
      on[i] = 2;
      flag = 1;
    } else
      on[i] = 1;
  }
  if (flag == 1)
    cout << 2 << endl;
  else
    cout << 1 << endl;
  for (int i = 2; i <= n; i++) cout << on[i] << " ";
  cout << on[n + 1] << endl;
  return 0;
}
