




from math import sqrt




def 							_UpperCAmelCase  (UpperCamelCase_ : int       ):
				'''simple docstring'''
				_lowerCAmelCase										=      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 							_UpperCAmelCase  (UpperCamelCase_ : int = 10000       ):
				'''simple docstring'''
				_lowerCAmelCase										=      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())))







import numpy as np




def 							_UpperCAmelCase  (UpperCamelCase_ : np.array       ):
				'''simple docstring'''
				return (2 / (1 + np.exp(-2 * vector       ))) - 1


if __name__ == "__main__":
	import doctest

	doctest.testmod()

