Number series
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
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 ≤ 10^12
).
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.
Examples
Input #1
Answer #1
Input #2
Answer #2
Submissions 1K
Acceptance rate 36%