Count Divisors


Submit solution

Points: 5
Time limit: 0.5s
Memory limit: 128M

Problem type

Given a positive integer \(N\) please determine the number of unique divisors of \(N\).

An integer \(X\) is a divisor of \(N\) if there exists an integer \(K\) where \(X \cdot K = N\).

Input Specification

The first line of the input will contain an integer \(N\) \((1 \le N \le 10^9)\).

Output Specification

Output an integer representing the number of unique divisors of \(N\).

Sample Input

9

Sample Output

3

Sample Explanation

The divisors of \(9\) are \(1\), \(3\), and \(9\).


Comments

There are no comments at the moment.