main = readLn >>= print . xsum

xsum :: Integer -> Integer
xsum n = (\x -> if d==1 then x else x+d) $ sum $ filter (\x -> mod d x == 0) [1 .. floor (sqrt (fromIntegral d))]
 where d = gcd n (div (n*(n-1)) 2)