
from math import sqrt






def   lowerCamelCase__							(					a      )      ->   str:
   _A:  Any					=       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   lowerCamelCase__							(					a = 1_00_00      )      ->   Any:
   _A:  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())))









def 				lowerCAmelCase_	(     snake_case_,snake_case_     ):
      while b:
            _A			,   _A							:     List[str]			=						b, a % b
      return a







def 				lowerCAmelCase_	(     snake_case_,snake_case_     ):
      return a if b == 0 else euclidean_gcd_recursive(snake_case_,a % b     )







def 				lowerCAmelCase_	(     ):
      print(f'''euclidean_gcd(3, 5) = {euclidean_gcd(3,5     )}'''     )
      print(f'''euclidean_gcd(5, 3) = {euclidean_gcd(5,3     )}'''     )
      print(f'''euclidean_gcd(1, 3) = {euclidean_gcd(1,3     )}'''     )
      print(f'''euclidean_gcd(3, 6) = {euclidean_gcd(3,6     )}'''     )
      print(f'''euclidean_gcd(6, 3) = {euclidean_gcd(6,3     )}'''     )

      print(f'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3,5     )}'''     )
      print(f'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5,3     )}'''     )
      print(f'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1,3     )}'''     )
      print(f'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3,6     )}'''     )
      print(f'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6,3     )}'''     )


if __name__ == "__main__":
  main()

