Problem Description

All positive integers can be represented as the sum of one, two, or more consecutive positive integers.

Given a positive integer not exceeding $9 \times 10^{14}$, determine how many different ways it can be expressed as the sum of consecutive positive integers. For example, given $9$, there are three ways: $9, 4+5, 2+3+4$.

Input Format

Input consists of a single positive integer $n$, which is the number to be decomposed.

Output Format

Output the number of ways $n$ can be expressed as the sum of consecutive positive integers.

Sample Input and Output

Sample Input #1

9

Sample Output #1

3

Sample Input #2

11

Sample Output #2

2

Sample Input #3

12

Sample Output #3

2

Notes

$n \leq 9 \times 10^{14}$

见题面 Input 部分

见题面 Output 部分