"""simple docstring"""






from math import sqrt


def 			UpperCAmelCase__       (				lowerCAmelCase__     :int		) ->    int:
      '''simple docstring'''


      lowercase														=	0
      for i in range(1					,		int(sqrt(lowerCAmelCase__		) + 1		)		):
            if n % i == 0 and i != sqrt(lowerCAmelCase__		):
                  total += i + n // i
            elif i == sqrt(lowerCAmelCase__		):
                  total += i
      return total - n


def 			UpperCAmelCase__       (				lowerCAmelCase__     :int = 1_0_0_0_0		) ->    int:
      '''simple docstring'''


      lowercase														=	sum(
          i
          for i in range(1					,		lowerCAmelCase__		)
          if sum_of_divisors(sum_of_divisors(lowerCAmelCase__		)		) == i and sum_of_divisors(lowerCAmelCase__		) != i		)
      return total


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




"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :str					,		lowerCAmelCase__     :Optional[Any]		) ->    int:
      '''simple docstring'''


      lowercase														=	[0 for i in range(r + 1		)]
      # nc0 = 1
      lowercase														=	1
      for i in range(1					,		n + 1		):
            # to compute current row from previous row.
            lowercase														=	min(lowerCAmelCase__					,		lowerCAmelCase__		)
            while j > 0:
                  c[j] += c[j - 1]
                  j -= 1
      return c[r]






print(binomial_coefficient(n=1_0, r=5))



