Given an integer $n$. In how many ways can $n$ be written as the sum of at least two consecutive positive integers.
For example: $12 = 3 + 4 + 5$.
### Input
- The first line contains a single integer $n$.
### Output
- A single integer is the number of ways.
### Constraints
- $1 \le x \le 10^{12}$.
### Example
Input:
```
12
```
Output:
```
1
```
