
'''simple docstring'''
def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE				):
							_snake_case,							_snake_case       =  len(_SCREAMING_SNAKE_CASE				), len(grid[0]				)
							if (
							    min(_SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE				) < 0
							    or row == row_length
							    or col == col_length
							    or (row, col) in visit
							    or grid[row][col] == 1
							):
														return 0
							if row == row_length - 1 and col == col_length - 1:
														return 1

							visit.add((row, col)				)

							_snake_case       =  0
							count += depth_first_search(_SCREAMING_SNAKE_CASE							, row + 1							, _SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE				)
							count += depth_first_search(_SCREAMING_SNAKE_CASE							, row - 1							, _SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE				)
							count += depth_first_search(_SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE							, col + 1							, _SCREAMING_SNAKE_CASE				)
							count += depth_first_search(_SCREAMING_SNAKE_CASE							, _SCREAMING_SNAKE_CASE							, col - 1							, _SCREAMING_SNAKE_CASE				)

							visit.remove((row, col)				)
							return count


if __name__ == "__main__":
				import doctest

				doctest.testmod()

'''simple docstring'''
from math import sqrt






def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE				):
							_snake_case       =  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  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE = 1_0000				):
							_snake_case       =  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())))