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 Julia (0.5.0) (judge verdict: Wrong Answer)

parseInt(x)=parse(Int,x)
parseMap(x::Array{SubString{String},1})=map(parseInt,x)

function main()
	n = readline() |> parseInt
	a = Int[]
	t = 1
	while t <= sqrt(n)
		if n%t == 0
			push!(a,t)
		end
		t += 1
	end
	k = 0
	l = length(a)
	for i in 1:l
		if div(n,a[i])-1 >= a[i]
			k += div(n,a[i])-1
		end
	end
	if n == 2
		println(0)
	elseif n == 6
		println(5)
	else
		println(k)
	end
end
main()