

"""simple docstring"""





from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

_a       =							(3, 9, -11, 0, 7, 5, 1, -1)
_a       =							(4, 6, 2, 0, 8, 10, 3, -2)




@dataclass
class 					_lowerCAmelCase  :







 """simple docstring"""







 __UpperCAmelCase	:					int
 __UpperCAmelCase	:					Node | None







class 					_lowerCAmelCase  :







 """simple docstring"""







 def __init__(			self							:			Optional[int],					UpperCAmelCase__							:			Iterable[int]	):
    __lowercase								=						None
    for i in sorted(UpperCAmelCase__,					reverse=UpperCAmelCase__	):
       __lowercase								=						Node(UpperCAmelCase__,					self.head	)


 def __iter__(			self							:			str	):
    __lowercase								=						self.head
    while node:
       yield node.data
       __lowercase								=						node.next_node


 def __len__(			self							:			Optional[int]	):
    return sum(1 for _ in self	)



 def __str__(			self							:			List[str]	):
    return " -> ".join([str(UpperCAmelCase__	) for node in self]	)







def   _A  (  UpperCamelCase_     :       SortedLinkedList,			UpperCamelCase_     :       SortedLinkedList)	->						SortedLinkedList:
   '''simple docstring'''


   return SortedLinkedList(list(UpperCamelCase_) + list(UpperCamelCase_))


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   _a       =							SortedLinkedList
   print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))







"""simple docstring"""





from math import sqrt




def   _A  (  UpperCamelCase_     :       int)	->						int:
   '''simple docstring'''


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




def   _A  (  UpperCamelCase_     :       int = 10000)	->						int:
   '''simple docstring'''


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


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




