#include <iostream>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair < int, int >
#define pll pair < long long, long long>
#define ull unsigned long long
#define vi vector <int>
#define sz(a) (int)a.size()
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
#define fname "lca"

const int inf = (int)1e9;
const ll INF = (ll)1e18;
const double eps = 1e-9;
const double pi = acos(-1.0);

int n;
bool ok[100100], prime[100100];

void calc(){
	for(int i = 2; i <= 100100; ++i){
		ok[i] = 1;
		prime[i] = 0;
	}
	for(int i = 2; i <= 100100; ++i){
		if(ok[i]){
			prime[i] = 1;
			for(ll j = (ll)i * (ll)i; j <= 100100; j += i){
				ok[j] = 0;
			}
		}
	}
}

int main(){
	// freopen("input.txt", "r", stdin);
	// freopen(fname".in", "r", stdin);
	// freopen(fname".out", "w", stdout);
	scanf("%d", &n);
	calc();
	if(n < 3)
		printf("1\n");
	else
		printf("2\n");
	for(int i = 2; i <= n + 1; ++i){
		if(prime[i])
			printf("1");
		else
			printf("2");
		if(i != n + 1)
			printf(" ");
	}
	return 0;
}