Time/Memory Limit:1000 MS/32768 K

Submitted: 37 Accepted: 21

Submitted: 37 Accepted: 21

### Problem Description

Everybody knows any number can be combined by the prime number.

Now, your task is telling me what position of the largest prime factor.

The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.

Specially, LPF(1) = 0.

Now, your task is telling me what position of the largest prime factor.

The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.

Specially, LPF(1) = 0.

### Input

Each line will contain one integer n(0 < n < 1000000).

### Output

Output the LPF(n).

### Sample Input

1 2 3 4 5

### Sample Output

0 1 2 1 3

### Author

### Source

HDU 2007'11 Programming Contest_WarmUp

### Recommend

zh