// Description
Count how many positive divisors the integer n has.
// Input
A single integer n (1 <= n <= 10^12).
// Output
The number of divisors of n.
// Hint
Trial-divide up to sqrt(n), counting divisors in pairs.