Ehab and a Special Coloring Problem

F. Ehab and a Special Coloring Problem

You're given an integer n n n. For every integer i i i from 2 2 2 to n n n, assign a positive integer a i a_i ai such that the following conditions hold:

• For any pair of integers ( i , j ) (i,j) (i,j), if i i i and j j j are coprime, a i ≠ a j a_i \neq a_j ai=aj.
• The maximal value of all a i a_i ai should be minimized (that is, as small as possible).

A pair of integers is called coprime if their greatest common divisor is 1 1 1.

Input

The only line contains the integer n n n ( 2 ≤ n ≤ 1 0 5 2 \le n \le 10^5 2≤n≤105).

Output

Print n − 1 n-1 n−1 integers, a 2 a_2 a2, a 3 a_3 a3, ... \ldots ..., a n a_n an ( 1 ≤ a i ≤ n 1 \leq a_i \leq n 1≤ai≤n).

If there are multiple solutions, print any of them.

Example

Input

4

Output

1 2 1

Input

3

Output

2 1

Node

In the first example, notice that 3 3 3 and 4 4 4 are coprime, so a 3 ≠ a 4 a_3 \neq a_4 a3=a4. Also, notice that a = [ 1 , 2 , 3 ] a=[1,2,3] a=[1,2,3] satisfies the first condition, but it's not a correct answer because its maximal value is 3 3 3.

code

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
 
using namespace std;


const int N = 2e5+10,INF=0x3f3f3f3f,mod=1e9+7;
 
typedef pair<int,int> PII;

int T=1;

void solve(){
	int n;
	cin>>n;
	vector<int> a(n+5,0);
	int k=2;
	for(int i=2;i<=n;i++){
		if(i%2==0) a[i]=1;
		else{
			if(a[i]==0){
				a[i]=k++;
				for(int j=2;j<n && i*j<=n;j++) a[i*j]=a[i];
			}else{
				continue;
			}
		}
	}
	for(int i=2;i<=n;i++) cout<<a[i]<<" ";
}

signed main(){
//	cin>>T; 
    while(T--){
        solve();
    }
    return 0;
}