eolymp
bolt
Try our new interface for solving problems
Problems

Smooth Divisors

Smooth Divisors

Time limit 1 second
Memory limit 122 MiB

The positive integer m is called a smooth divisor of n if the quotient and remainder of dividing n by m are equal. The positive integer n is given. Find the number of its smooth divisors.

Input data

The positive integer n\:(1 \le n \le 10^6).

Output data

Print the required number of smooth divisors for number n.

Examples

Input example #1
20
Output example #1
2
Author Pavel Kuznecov, Fedor Menschikov