p03050 diverta 2019 Programming Contest - DivRem Number
Snuke received a positive integer N from Takahashi. A positive integer m is called a favorite number when the following condition is satisfied:

* The quotient and remainder of N divided by m are equal, that is, \lfloor \frac{N}{m} \rfloor = N \bmod m holds.



Find all favorite numbers and print the sum of those.

Constraints

* All values in input are integers.
* 1 \leq N \leq 10^{12}

Input

Input is given from Standard Input in the following format:


N


Output

Print the answer.

Examples

Input

8


Output

10


Input

1000000000000


Output

2499686339916
```python
n=int(input())
print(sum([n//x-1 for x in range(1,int(n**.5)+1) if n%x==0 and n//x-1>x]))
```