How many different sequences of integers are there where the difference between two adjacent elements is 1 and the sum of elements in the sequence is n?

Input

One integer n (1 ≤ n ≤ 1012).

Output

Print one integer - the number of different numerical sequences consisting of integers with a difference of 1 and elements with a sum of n.