Solved Problem - Factorization

Problem statement

Given a number $N > 1$, count the number of factors of the number N.

Input format

A single line of input contains the number $1 \leq N \leq 10^{12}$.

Output format

Print a single integer equal to the number of factors of $N$.

---

Sample

Input

36

Output

9

---

Explanation

Factors of $36 : 1, 2, 3, 4, 6, 9, 12, 18, 36$

Count: $9$

---

Brute force

The brute force solution would be to loop over all the numbers from 1 to N and check if it is a factor. If it is, you would then print it.

We can use the modulus operator to check if it’s a factor or not.

Here is the code: