
'''simple docstring'''
import itertools
import math






def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE				):





       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(lowercase__				) + 1				)							, 6				):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True






def  __SCREAMING_SNAKE_CASE				(  ):
       _snake_case       =  2
       while True:
              if is_prime(lowercase__				):
                     yield num
              num += 1






def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE = 1_0001				):
       return next(itertools.islice(prime_generator()							, nth - 1							, lowercase__				)				)


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

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