




"""simple docstring"""


import itertools
import math


def 					UpperCAmelCase__       (snake_case__							:					int    ):
  """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 					UpperCAmelCase__       ():
  """simple docstring"""

  _snake_case							:		str								=  2
  while True:
    if is_prime(snake_case__    ):
      yield num
    num += 1


def 					UpperCAmelCase__       (snake_case__							:					int = 1_00_01    ):
  """simple docstring"""

  return next(itertools.islice(prime_generator()		,   nth - 1		,   snake_case__    )    )


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




"""simple docstring"""





def       lowerCamelCase__		(			__snake_case = 10_00	)							->		int:


					"""simple docstring"""





					_UpperCamelCase							 =  2**power
					_UpperCamelCase							 =  str(__snake_case	)
					_UpperCamelCase							 =  list(__snake_case	)
					_UpperCamelCase							 =  0

					for i in list_num:
										sum_of_num += int(__snake_case	)

					return sum_of_num


if __name__ == "__main__":
				_a														=		int(input("""Enter the power of 2: """).strip())
				print("""2 ^ """, power, """ = """, 2**power)
				_a														=		solution(power)
				print("""Sum of the digits is: """, result)






