How many different sequences of integers are there where the difference between two adjacent elements is and the sum of elements in the sequence is ?
One integer (1 \leq n \leq 10^{12}).
Print one integer - the number of different numerical sequences consisting of integers with a difference of and elements with a sum of .
Example 1
Example 2