output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: from math import floor, sqrt
  N = int(input())
  def make_divisors(n):
      divisors = []
      for i in range(1, int(n**0.5) + 1):
          if n % i == 0:
              divisors.append(i)
              if i != n // i:
                  divisors.append(n // i)
  
      divisors.sort()
      return divisors
  div = make_divisors(N)
  max_div = floor(sqrt(N))
  ans = 0
  
  for d in div:
      if N % 
      if d <= max_div:
          ans += (N-d)//d
          print(d, (N-d)//d, ans)
  print(ans+1)
  
problem_description: 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.
samples: [{"input": "8", "output": "10\n    \n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\n* * *"}, {"input": "1000000000000", "output": "2499686339916\n    \n\nWatch out for overflow."}]