
'''simple docstring'''

from math import sqrt







def 	A  (   UpperCamelCase_       :  int   )       ->							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 	A  (   UpperCamelCase_       :  int = 1_00_00   )       ->							int:







			'''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())))









def     lowercase	(    a     , a     , a     , a ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_				:int				     =						[False] * len(a )
		SCREAMING_SNAKE_CASE_				:List[Any]				     =						[]
		queue.append(a )
		SCREAMING_SNAKE_CASE_				:int				     =						True

		while queue:
				SCREAMING_SNAKE_CASE_				:int				     =						queue.pop(0 )
				for ind in range(len(graph[u] ) ):
						if visited[ind] is False and graph[u][ind] > 0:
								queue.append(a )
								SCREAMING_SNAKE_CASE_				:Tuple				     =						True
								SCREAMING_SNAKE_CASE_				:Optional[int]				     =						u

		return visited[t]


def     lowercase	(    a     , a     , a ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_				:Any				     =						[-1] * (len(a ))
		SCREAMING_SNAKE_CASE_				:Tuple				     =						0
		while bfs(a     , a     , a     , a ):
				SCREAMING_SNAKE_CASE_				:List[Any]				     =						float("Inf" )
				SCREAMING_SNAKE_CASE_				:str				     =						sink

				while s != source:
						# Find the minimum value in select path
						SCREAMING_SNAKE_CASE_				:str				     =						min(a     , graph[parent[s]][s] )
						SCREAMING_SNAKE_CASE_				:Optional[Any]				     =						parent[s]

				max_flow += path_flow
				SCREAMING_SNAKE_CASE_				:Dict				     =						sink

				while v != source:
						SCREAMING_SNAKE_CASE_				:int				     =						parent[v]
						graph[u][v] -= path_flow
						graph[v][u] += path_flow
						SCREAMING_SNAKE_CASE_				:Any				     =						parent[v]
		return max_flow


SCREAMING_SNAKE_CASE__     					=			[
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

SCREAMING_SNAKE_CASE__					,    SCREAMING_SNAKE_CASE__     					=			0, 5
print(ford_fulkerson(graph, source, sink))






