Question
Count Divisors of N
Arjun is given a number n, and he’s curious to find out how many numbers divide n perfectly, leaving no remainder. Can you help Arjun count all such divisors of n?
Input
The first line of input contains a single integer n.
Constraints
1 ≤ n ≤ 106
Constraints
1 ≤ n ≤ 106
Output
Print the count of numbers that can divide 'n' without leaving a remainder.
Example
Sample Input
8
Sample Output
4
Explanation
Numbers that can divide 'n' without leaving a remainder = 1, 2, 4, 8.
Thus, count = 4.
8
Sample Output
4
Explanation
Numbers that can divide 'n' without leaving a remainder = 1, 2, 4, 8.
Thus, count = 4.