Divisors

Input

The input contains a single integer.

Subtask №1 [25 points] Constraints: 0 < N < 1001.

Subtask №2 [25 points] Constraints: 0 < N < 2\,000\,000,000.

Subtask №3 [50 points] Constraints: 0 < N < 10^{100}. Additionally, all prime divisors of $N$ will not exceed $1000$.

Output

Output a single integer — the number of divisors of $N$.

Examples