

from math import sqrt





def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							snake_case_          =   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  __lowerCamelCase     (			UpperCamelCase__ = 10000				):







							'''simple docstring'''






							snake_case_          =   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())))







from __future__ import annotations





def  __lowerCamelCase     (			UpperCamelCase__       ,							UpperCamelCase__ = None       ,							UpperCamelCase__ = None				):







							'''simple docstring'''






							if start is None:
														snake_case_          =   0

							if end is None:
														snake_case_          =   len(UpperCamelCase__				) - 1

							if start >= end:
														return

							snake_case_          =   (start + end) // 2

							slowsort(UpperCamelCase__       ,							UpperCamelCase__       ,							UpperCamelCase__				)
							slowsort(UpperCamelCase__       ,							mid + 1       ,							UpperCamelCase__				)

							if sequence[end] < sequence[mid]:
														snake_case_    ,   snake_case_          =   sequence[mid], sequence[end]

							slowsort(UpperCamelCase__       ,							UpperCamelCase__       ,							end - 1				)


if __name__ == "__main__":
					from doctest import testmod

					testmod()




