Byang is going to join a new school. His new class has $N$ students.

Each of the students are identified by their roll numbers starting from $1$ to $N$. Byang’s roll number will be $N$.

Byang plans to make friends with only those whose roll numbers are a divisor of his roll number.

Can you help Byang count how many friends he could potentially make? You can assume everyone wants to be Byang’s friend.

Input

The input will contain an integer $N$ ($0 < N < 1000000$).

Output

Print the number of friends Byang will make in his new class.

Sample

Input	Output
6	3