

'''simple docstring'''
import numpy as np







def  _A		(     snake_case		,							snake_case		,							snake_case		,							snake_case		,							snake_case					)      ->     Tuple:
   _lowercase      :				Tuple      					=       int(np.ceil((x_end - xa) / h					)					)
   _lowercase      :				Any      					=       np.zeros((n + 1,)					)
   _lowercase      :				Tuple      					=       ya
   _lowercase      :				Optional[Any]      					=       xa

   for k in range(SCREAMING_SNAKE_CASE_					):
      _lowercase      :				int      					=       f(SCREAMING_SNAKE_CASE_		,							y[k]					)
      _lowercase      :				Tuple      					=       f(x + 0.5 * h		,							y[k] + 0.5 * h * ka					)
      _lowercase      :				int      					=       f(x + 0.5 * h		,							y[k] + 0.5 * h * ka					)
      _lowercase      :				List[str]      					=       f(x + h		,							y[k] + h * ka					)
      _lowercase      :				List[str]      					=       y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
      x += h

   return y


if __name__ == "__main__":
    import doctest

    doctest.testmod()









'''simple docstring'''
from math import sqrt







def  _A		(     snake_case					)      ->     int:
   _lowercase      :				str      					=       0
   for i in range(1		,							int(sqrt(snake_case					) + 1					)					):
      if n % i == 0 and i != sqrt(snake_case					):
         total += i + n // i
      elif i == sqrt(snake_case					):
         total += i
   return total - n







def  _A		(     snake_case = 1_00_00					)      ->     int:
   _lowercase      :				List[Any]      					=       sum(
       i
       for i in range(1		,							snake_case					)
       if sum_of_divisors(sum_of_divisors(snake_case					)					) == i and sum_of_divisors(snake_case					) != i					)
   return total


if __name__ == "__main__":
    print(solution(int(str(input()).strip())))






