Problem:
Score : 500 points

Problem Statement

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.

Sample Input 1

8

Sample Output 1

10

There are two favorite numbers: 3 and 7. Print the sum of these, 10.

Sample Input 2

1000000000000

Sample Output 2

2499686339916

Watch out for overflow.

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

require 'prime'
n = 8
a = n.prime_division.map{|m|(m[1]+1).times.map{|mt| m[0]**mt}}.inject([1]){|s,i| s = s.flat_map{|sm| i.map{|im| im * sm }}}.sort
a[(a.size+1)/2..-1].map{|m|m-1}.sum