



from math import sqrt



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



def __lowerCAmelCase	(       SCREAMING_SNAKE_CASE_ = 1_0000					):
			lowercase__   					=			sum(
			    i
			    for i in range(1  ,					SCREAMING_SNAKE_CASE_					)
			    if sum_of_divisors(sum_of_divisors(SCREAMING_SNAKE_CASE_					)					) == i and sum_of_divisors(SCREAMING_SNAKE_CASE_					) != i					)
			return total


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









from graphs.minimum_spanning_tree_kruskal import kruskal



def __lowerCAmelCase	(       ):
			lowercase__   					=			9
			lowercase__   					=			[
			    [0, 1, 4],
			    [0, 7, 8],
			    [1, 2, 8],
			    [7, 8, 7],
			    [7, 6, 1],
			    [2, 8, 2],
			    [8, 6, 6],
			    [2, 3, 7],
			    [2, 5, 4],
			    [6, 5, 2],
			    [3, 5, 14],
			    [3, 4, 9],
			    [5, 4, 10],
			    [1, 7, 11],
			]

			lowercase__   					=			kruskal(SCREAMING_SNAKE_CASE_  ,					SCREAMING_SNAKE_CASE_					)

			lowercase__   					=			[
			    [7, 6, 1],
			    [2, 8, 2],
			    [6, 5, 2],
			    [0, 1, 4],
			    [2, 5, 4],
			    [2, 3, 7],
			    [0, 7, 8],
			    [3, 4, 9],
			]

			assert sorted(SCREAMING_SNAKE_CASE_					) == sorted(SCREAMING_SNAKE_CASE_					)




