





"""simple docstring"""






from math import sqrt






def      lowercase__ (					lowerCAmelCase__   :			int			)    ->			int:



			'''simple docstring'''
			a__  :	Optional[int]		 =			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 = 1_0_0_0_0			)    ->			int:



			'''simple docstring'''
			a__  :	Tuple		 =			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())))






"""simple docstring"""






from __future__ import annotations






def      lowercase__ (					lowerCAmelCase__   :			int			)    ->			list[int]:



			'''simple docstring'''
			a__  :	Tuple		 =			[True] * limit
			a__  :	Tuple		 =			False
			a__  :	int		 =			False
			a__  :	Tuple		 =			True

			for i in range(3							,			int(limit**0.5 + 1			)							,			2			):
						a__  :	int		 =			i * 2
						while index < limit:
									a__  :	Union[str, Any]		 =			False
									a__  :	int		 =			index + i

			a__  :	str		 =			[2]

			for i in range(3							,			lowerCAmelCase__							,			2			):
						if is_prime[i]:
									primes.append(lowerCAmelCase__			)

			return primes






def      lowercase__ (					lowerCAmelCase__   :			int = 1_0_0_0_0_0_0			)    ->			int:



			'''simple docstring'''
			a__  :	List[Any]		 =			prime_sieve(lowerCAmelCase__			)
			a__  :	int		 =			0
			a__  :	str		 =			0

			for i in range(len(lowerCAmelCase__			)			):
						for j in range(i + length							,			len(lowerCAmelCase__			)			):
									a__  :	List[str]		 =			sum(primes[i:j]			)
									if sol >= ceiling:
												break

									if sol in primes:
												a__  :	Tuple		 =			j - i
												a__  :	Union[str, Any]		 =			sol

			return largest


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