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





def 			lowerCamelCase_ (				lowerCamelCase__    ):

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





def 			lowerCamelCase_ (				):
				lowerCamelCase_						=			2
				while True:
								if is_prime(lowerCamelCase__    ):
												yield num
								num += 1





def 			lowerCamelCase_ (				lowerCamelCase__ = 2_0_0_0_0_0_0    ):
				return sum(takewhile(lambda lowerCamelCase__    : x < n	, prime_generator()    )    )


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



"""simple docstring"""
def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->Union[str, Any]:
  if height >= 1:
    move_tower(height - 1		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )
    move_disk(_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )
    move_tower(height - 1		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )







def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->Union[str, Any]:
  print('moving disk from'		,     _SCREAMING_SNAKE_CASE		,     'to'		,     _SCREAMING_SNAKE_CASE   )







def 						__a   (	)	->List[str]:
  a__:     Dict										=	int(input('Height of hanoi: '   ).strip()   )
  move_tower(_SCREAMING_SNAKE_CASE		,     'A'		,     'B'		,     'C'   )


if __name__ == "__main__":
 main()


