#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{
ll s=0;
bool f=0;
char ch=' ';
while(!isdigit(ch))
{
f|=(ch=='-'); ch=getchar();
}
while(isdigit(ch))
{
s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
}
return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{
if(x<0)
{
putchar('-'); x=-x;
}
if(x<10)
{
putchar(x+'0'); return;
}
write(x/10);
putchar((x%10)+'0');
return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) write(x),putchar('\n')
const int N=100005;
int n;
bool Bo[N];
int Prime[N];
inline void Get_Prime()
{
int i,j;
for(i=2;i<=n;i++)
{
if(!Bo[i]) Prime[++*Prime]=i;
for(j=1;j<=*Prime&&Prime[j]*i<=n;j++)
{
Bo[Prime[j]*i]=1;
if(i%Prime[j]==0) break;
}
}
return;
}
int main()
{
int i;
n=read()+1;
if(n==2) return 0*printf("1\n1\n");
if(n==3) return 0*printf("1\n1 1\n");
Get_Prime();
puts("2");
for(i=2;i<=n;i++)
{
W((Bo[i])?(2):(1));
}
return 0;
}