Stepan is interested in the greatest common divisor of a pair of numbers, specifically . Given an integer , Stepan wants to know how many pairs of integers exist such that and the equation is satisfied.
One integer .
Print the number of required pairs.