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






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






def    lowerCamelCase__				(				):




			"""simple docstring"""


			lowerCAmelCase_						=	2
			while True:
						if is_prime(__lowerCAmelCase				):
									yield num
						num += 1






def    lowerCamelCase__				(				__lowerCAmelCase  :  int = 2000000				):




			"""simple docstring"""


			return sum(takewhile(lambda __lowerCAmelCase				: x < n    ,							prime_generator()				)				)


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





from pathlib import Path

import fire






def    lowerCamelCase__				(				__lowerCAmelCase  :  str    ,							__lowerCAmelCase  :  str    ,							__lowerCAmelCase  :  int				):




			"""simple docstring"""


			lowerCAmelCase_						=	Path(__lowerCAmelCase				)
			lowerCAmelCase_						=	Path(__lowerCAmelCase				)
			dest_dir.mkdir(exist_ok=__lowerCAmelCase				)
			for path in src_dir.iterdir():
						lowerCAmelCase_						=	[x.rstrip() for x in list(path.open().readlines()				)][:n]
						lowerCAmelCase_						=	dest_dir.joinpath(path.name				)
						print(__lowerCAmelCase				)
						dest_path.open("w"				).write("\n".join(__lowerCAmelCase				)				)


if __name__ == "__main__":
			fire.Fire(minify)



