Number of divisors
Given a positive integer n, you are asked to calculate the number of divisors of n (including 1 and n itself).
Input
The first line of the input contains a single integer n (2 ≤ n ≤ ).
Output
The program should print the number of divisors of n.
Examples
Input | Output |
|---|---|
8 | 4 |
17 | 2 |
2048 | 12 |
Explanation
8: 1, 2, 4, 8
17: 1, 17 (17 is a prime number)
2048: 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048 (a power of 2 is only divisible by ALL the powers of 2 smaller than or equal to itself)
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB