Time Limit: 2 sec / Memory Limit: 512 MB

### Problem Statement

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 \ge 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.

### Sample Input 1

25

### Output for Sample Input 1

10

### Sample Input 2

1

### Output for Sample Input 2

1

### Sample Input 3

5

### Output for Sample Input 3

4

### Sample Input 4

83160

### Output for Sample Input 4

5120