Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]
B
LCM
Codeforces
1200
原题
← AC →
翻译中…

Ivan has number $b$. He is sorting through the numbers $a$ from $1$ to $10^{18}$, and for every $a$ writes $\frac{[a, \,\, b]}{a}$ on blackboard. Here $[a, \,\, b]$ stands for least common multiple of $a$ and $b$. Ivan is very lazy, that's why this task bored him soon. But he is interested in how many different numbers he would write on the board if he would finish the task. Help him to find the quantity of different numbers he would write on the board.

翻译中…

Input

翻译中…

The only line contains one integer — $b$ $(1 \le b \le 10^{10})$.

翻译中…

Output

翻译中…

Print one number — answer for the problem.

翻译中…

Note

翻译中…

In the first example $[a, \,\, 1] = a$, therefore $\frac{[a, \,\, b]}{a}$ is always equal to $1$.

翻译中…

In the second example $[a, \,\, 2]$ can be equal to $a$ or $2 \cdot a$ depending on parity of $a$. $\frac{[a, \,\, b]}{a}$ can be equal to $1$ and $2$.

翻译中…

样例

Input #1
1
Output #1
1
InputCopy OutputCopy
Input #2
2
Output #2
2
InputCopy OutputCopy
题目信息
题号
1068B
时间限制
1 s
内存限制
256 MB
标签
数学
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。