






from math import sqrt

def   __lowercase       (			snake_case			):







				"""simple docstring"""






				__magic_name__		:Tuple   =   0
				for i in range(1,	int(sqrt(snake_case			) + 1			)			):
								if n % i == 0 and i != sqrt(snake_case			):
												total += i + n // i
								elif i == sqrt(snake_case			):
												total += i
				return total - n

def   __lowercase       (			snake_case = 1_0_0_0_0			):







				"""simple docstring"""






				__magic_name__		:List[str]   =   sum(
				    i
				    for i in range(1,	snake_case			)
				    if sum_of_divisors(sum_of_divisors(snake_case			)			) == i and sum_of_divisors(snake_case			) != i			)
				return total


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














import math
from collections.abc import Iterator
from itertools import takewhile

def   __lowercase       (			snake_case			):







				"""simple docstring"""






				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5,	int(math.sqrt(snake_case			) + 1			),	6			):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def   __lowercase       (			):







				"""simple docstring"""






				__magic_name__		:str   =   2
				while True:
								if is_prime(snake_case			):
												yield num
								num += 1

def   __lowercase       (			snake_case = 2_0_0_0_0_0_0			):







				"""simple docstring"""






				return sum(takewhile(lambda snake_case			: x < n,	prime_generator()			)			)


if __name__ == "__main__":
					print(f"{solution() = }")






