CF1068B.LCM
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Ivan has number b . He is sorting through the numbers a from 1 to 1018 , and for every a writes a[a,b] 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.
输入格式
The only line contains one integer — b (1≤b≤1010) .
输出格式
Print one number — answer for the problem.
输入输出样例
输入#1
1
输出#1
1
输入#2
2
输出#2
2
说明/提示
In the first example [a,1]=a , therefore a[a,b] is always equal to 1 .
In the second example [a,2] can be equal to a or 2⋅a depending on parity of a . a[a,b] can be equal to 1 and 2 .