




from math import sqrt




def        _SCREAMING_SNAKE_CASE      (		snake_case       )						->				int:
						_UpperCAmelCase      =			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      (		snake_case = 1_0_0_0_0       )						->				int:
						_UpperCAmelCase      =			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())))





from __future__ import annotations




def        _SCREAMING_SNAKE_CASE      (		snake_case       )						->				list[int]:
						if len(snake_case       ) == 0:
												return array

						_UpperCAmelCase    ,					_UpperCAmelCase      =			min(snake_case       ), max(snake_case       )

						# Compute the variables
						_UpperCAmelCase      =			_max - _min + 1
						_UpperCAmelCase    ,					_UpperCAmelCase      =			[0] * holes_range, [0] * holes_range

						# Make the sorting.
						for i in array:
												_UpperCAmelCase      =			i - _min
												_UpperCAmelCase      =			i
												holes_repeat[index] += 1

						# Makes the array back by replacing the numbers.
						_UpperCAmelCase      =			0
						for i in range(snake_case       ):
												while holes_repeat[i] > 0:
																		_UpperCAmelCase      =			holes[i]
																		index += 1
																		holes_repeat[i] -= 1

    # Returns the sorted array.
						return array


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				a													=			input("Enter numbers separated by comma:\n")
				a													=			[int(x) for x in user_input.split(",")]
				print(pigeon_sort(unsorted))