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


def 	lowerCamelCase					(	UpperCamelCase     :				int							)   ->    bool:

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


def 	lowerCamelCase					(	)   ->    Iterator[int]:
		_lowerCamelCase				   =  2
		while True:
				if is_prime(UpperCamelCase							):
						yield num
				num += 1


def 	lowerCamelCase					(	UpperCamelCase     :				int = 2_00_00_00							)   ->    int:
		return sum(takewhile(lambda UpperCamelCase							: x < n			,       prime_generator()							)							)


if __name__ == "__main__":
				print(F'''{solution() = }''')
def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    float:
		return base * power(UpperCamelCase			,       (exponent - 1)							) if exponent else 1


if __name__ == "__main__":
				print('Raise base to the power of exponent using recursion...')
				A						=			int(input('Enter the base: ').strip())
				A						=			int(input('Enter the exponent: ').strip())
				A						=			power(base, abs(exponent))
				if exponent < 0:  # power() does not properly deal w/ negative exponents
								A						=			1 / result
				print(F'''{base} to the power of {exponent} is {result}''')