




from math import sqrt

def     _SCREAMING_SNAKE_CASE    (							lowercase			: int  ):


      '''simple docstring'''



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

def     _SCREAMING_SNAKE_CASE    (							lowercase			: int = 1_00_00  ):


      '''simple docstring'''



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


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









def     _SCREAMING_SNAKE_CASE    (							lowercase			: list[int]			,							lowercase			: list[int]  ):


      '''simple docstring'''



      lowerCamelCase_	  =					len(lowercase  )
      print('The following activities are selected:'  )

      # The first activity is always selected
      lowerCamelCase_	  =					0
      print(lowercase			,							end=','  )

      # Consider rest of the activities
      for j in range(lowercase  ):
            # If this activity has start time greater than
            # or equal to the finish time of previously
            # selected activity, then select it
            if start[j] >= finish[i]:
                  print(lowercase			,							end=','  )
                  lowerCamelCase_	  =					j


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 lowerCamelCase       :	Tuple									=     [1, 3, 0, 5, 8, 5]
 lowerCamelCase       :	int									=     [2, 4, 6, 7, 9, 9]
 print_max_activities(start, finish)



