Every positive integer can be represented as the sum of one or more consecutive positive integers. Given a positive integer $n$ not exceeding $9 \times 10^{14}$, find the number of different ways it can be represented as a sum of consecutive positive integers. For example, for $9$, there are three ways: $9$, $4+5$, and $2+3+4$.
Input
Input a single integer $n$, where $1 \le n \le 9 \times 10^{14}$.
Output
Output the number of ways to represent $n$ as a sum of consecutive positive integers.
Examples
Input 1
9
Output 1
3
Input 2
11
Output 2
2
Input 3
12
Output 3
2