Problem Statement

treeone has decided to make every one of his user IDs follow the format "name + some number $X$ ".
The number $X$ appended to the end of the user ID is determined by the following procedure.

First, choose an arbitrary positive integer $N$, $1$ in number.
Next, enumerate the pairs of $2$ positive integers whose product is $N$.
Finally, the candidates for $X$ are the results of concatenating, as strings, the $2$ numbers of each pair enumerated above.

For example, when $N = 6$, there are $2$ pairs of $2$ numbers whose product is $6$, namely $(1, 6), (2, 3) $,
so there are $4$ candidates for $X$: $16, 61, 23, 32$.

Given $N$, find how many candidates for $X$ there are.

Input

$N$

$ 1 \leqq N \leqq 10^{12}$
$N$ is an integer.

Output

Output the number of candidates for $X$. Print a newline at the end.

Sample

6

4

63

6

49

3