【CodeForces 776B】 Sherlock and his girlfriend （求素数）

Sherlock and his girlfriend

Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.

He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n + 1.

Watson gave Sherlock a challenge to color these jewelry pieces such that two pieces don't have the same color if the price of one piece is a prime divisor of the price of the other piece. Also, Watson asked him to minimize the number of different colors used.

Help Sherlock complete this trivial task.

Input

The only line contains single integer n (1 ≤ n ≤ 100000) — the number of jewelry pieces.

Output

The first line of output should contain a single integer k, the minimum number of colors that can be used to color the pieces of jewelry with the given constraints.

The next line should consist of n space-separated integers (between 1 and k) that specify the color of each piece in the order of increasing price.

If there are multiple ways to color the pieces using k colors, you can output any of them.

Examples

input

3

output

21 1 2 

input

4

output

22 1 1 2

Note

In the first input, the colors for first, second and third pieces of jewelry having respective prices 2, 3 and 4 are 1, 1 and 2 respectively.

In this case, as 2 is a prime divisor of 4, colors of jewelry having prices 2 and 4 must be distinct.

题目大意：一个数不能和它的质因数是同一个数字

思路：只要让素数为1，合数为2就行了。当时居然因为不认识prime divisor而读错了题，掉分……果然要好好学英语了。暴力搞就能过，不过趁此机会学一下求素数的各种方法。

#include<bits/stdc++.h>#define manx 100005using namespace std;int a[manx];bool Su(int n){    int i;    for (i=2; i*i<n; i++)        if(n%i==0) return false;    if(i*i==n) return false;    return true;}void fun(int n){    for (int i=2; i<=n+1; i++)        if(Su(i)) a[i]=1;        else a[i]=2;}int main(){    int n;    scanf("%d",&n);    fun(n);    if(n==1 || n==2) printf("1\n");  //需注意    else     printf("2\n");    for (int i=2; i<=n; i++) printf("%d ",a[i]);    printf("%d\n",a[n+1]);    return 0;}