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

  * For any pair of integers (i,j), if i and j are coprime, a_i ≠ a_j. 
  * The maximal value of all a_i should be minimized (that is, as small as possible). 



A pair of integers is called [coprime](https://en.wikipedia.org/wiki/Coprime_integers) if their [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) is 1.

Input

The only line contains the integer n (2 ≤ n ≤ 10^5).

Output

Print n-1 integers, a_2, a_3, …, a_n (1 ≤ a_i ≤ n). 

If there are multiple solutions, print any of them.

Examples

Input


4


Output


1 2 1 

Input


3


Output


2 1

Note

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

Solution (in PYTHON3):

Solution:
# coding: utf-8
import sys
from functools import reduce
from heapq import heappush, heappop, heapify
sys.setrecursionlimit(int(1e7))
R = lambda: map(int, input().split())

def gcd(a,b):
    if b==0: return a
    return gcd(b, a%b)

def main():
    n, = R()
    div = [0]*(n+1)
    cnt = 1
    for i in range(2, n+1):
        for j in range(i*i, n+1, i):
            if div[j]==0: div[j] = cnt
        if div[i]==0: div[i] = cnt; cnt += 1
    print(' '.join(map(str, div[2:])))
    return

while 1:
    try: main()
    except EOFError: break