Background

Obito and Rin are a great ship.

Problem Description

Rin has $n$ integers $1 \sim n$.

Obito can now choose at least $2$ numbers and obtain their greatest common divisor. After each choice, the numbers are not removed, and the next time he can choose repeatedly.

Obito can make any number of choices. Ask how many different numbers he can obtain.

Input Format

One line with one integer $n$.

Output Format

One line, output the answer.

3

1

4

2

Hint

Sample Explanation

Sample #1:

The greatest common divisors are $\gcd(1,2)=1,\gcd(1,3)=1,\gcd(2,3)=1,\gcd(1,2,3)=1$, so there is one in total.

Sample #2:

It can be obtained that there are two different greatest common divisors in total.

Constraints

This problem uses bundled testdata.

For all data, it is guaranteed that:

$1\le n \le 10^{18}$。

Translated by ChatGPT 5