
"""simple docstring"""






def __lowercase     (      lowerCamelCase_  :      Optional[Any]  ):
				if upper_limit < 0:
								raise ValueError("Limit for the Catalan sequence must be ≥ 0"  )

				SCREAMING_SNAKE_CASE__     							=				[0] * (upper_limit + 1)

				# Base case: C(0) = C(1) = 1
				SCREAMING_SNAKE_CASE__     							=				1
				if upper_limit > 0:
								SCREAMING_SNAKE_CASE__     							=				1

				# Recurrence relation: C(i) = sum(C(j).C(i-j-1)), from j = 0 to i
				for i in range(2						,					upper_limit + 1  ):
								for j in range(lowerCamelCase_  ):
												catalan_list[i] += catalan_list[j] * catalan_list[i - j - 1]

				return catalan_list


if __name__ == "__main__":
	print('\n********* Catalan Numbers Using Dynamic Programming ************\n')
	print('\n*** Enter -1 at any time to quit ***')
	print('\nEnter the upper limit (≥ 0) for the Catalan number sequence: ', end='')
	try:
		while True:
			_lowerCamelCase     =  int(input().strip())
			if N < 0:
				print('\n********* Goodbye!! ************')
				break
			else:
				print(f"""The Catalan numbers from 0 through {N} are:""")
				print(catalan_numbers(N))
				print('Try another upper limit for the sequence: ', end='')
	except (NameError, ValueError):
		print('\n********* Invalid input, goodbye! ************\n')

	import doctest

	doctest.testmod()




"""simple docstring"""






from math import sqrt


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


def __lowercase     (      lowerCamelCase_  :      int = 10000  ):
				SCREAMING_SNAKE_CASE__     							=				sum(
				    i
				    for i in range(1						,					lowerCamelCase_  )
				    if sum_of_divisors(sum_of_divisors(lowerCamelCase_  )  ) == i and sum_of_divisors(lowerCamelCase_  ) != i  )
				return total


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