Sum of QQ

You received a card with an integer $S$ and a multiplication table of infinite size. All the elements in the table are integers, and an integer at the $i$-th row from the top and the $j$-th column from the left is $A_{i,j} = i \times j$ ($i,j \geq 1$). The table has infinite size, i.e., the number of the rows and the number of the columns are infinite.

You love rectangular regions of the table in which the sum of numbers is $S$. Your task is to count the number of integer tuples $(a, b, c, d)$ that satisfies $1 \leq a \leq b, 1 \leq c \leq d$ and $\sum_{i=a}^b \sum_{j=c}^d A_{i,j} = S$.

Input

The input consists of a single test case of the following form.

$S$

The first line consists of one integer $S$ ($1 \leq S \leq 10^5$), representing the summation of rectangular regions you have to find.

Output

Print the number of rectangular regions whose summation is $S$ in one line.

Examples

Input

25

Output

10

Input

1

Output

1

Input

5

Output

4

Input

83160

Output

5120

inputFormat

Input

The input consists of a single test case of the following form.

$S$

The first line consists of one integer $S$ ($1 \leq S \leq 10^5$), representing the summation of rectangular regions you have to find.

outputFormat

Output

Print the number of rectangular regions whose summation is $S$ in one line.

Examples

Input

25

Output

10

Input

1

Output

1

Input

5

Output

4

Input

83160

Output

5120

样例

25

10