output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def toku(xxx):
      a = int(xxx)
      x = 0
      last = 0
      p = list(range(int(a**0.5) + 1))
      ok = 0
      p.pop(0)
      for i in p:
          if a % i == 0:
              ok += 1
              last = i
      if a / last - last < 2:
          x = 1
      return ok - x
  
  
  print(toku(input()))
  
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."}]