Strange numbers#2416

Strange numbers

1 second

64 megabytes

Very easy

Once a financier pondered the following question: Is it possible, for a reporting period, to have negative totals for every interval of months of the same length, but to obtain a positive total for the entire reporting period?

Our task is to help him. Write a program that, for a given positive integer $N$ , determines the total number of integers $n$ such that it is possible to create a sequence of length $N$ where the sum of its members is positive, but every segment of length $n$ has a negative sum.

Input

The only line of input contains an integer $N$ ( $1 \leq N \leq 2 \cdot 1 0^{10}$ 1 \leq N \leq 2 \cdot 10^{10}).

Output

Print a single number — the answer to the problem.

Examples

Example 1

Loading

1 \leq N \leq 2 \cdot 1 0^{10}