'''simple docstring'''







from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_tokenizers_available


UpperCamelCase_      	=	{"""tokenization_herbert""": ["""HerbertTokenizer"""]}

try:
		if not is_tokenizers_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		UpperCamelCase_      	=	["""HerbertTokenizerFast"""]


if TYPE_CHECKING:
		from .tokenization_herbert import HerbertTokenizer

		try:
				if not is_tokenizers_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .tokenization_herbert_fast import HerbertTokenizerFast

else:
		import sys

		UpperCamelCase_      	=	_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)














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

def   __lowercase       (			snake_case			):







				"""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   __lowercase       (			):







				"""simple docstring"""






				__magic_name__		:str   =   2
				while True:
								if is_prime(snake_case			):
												yield num
								num += 1

def   __lowercase       (			snake_case = 2_0_0_0_0_0_0			):







				"""simple docstring"""






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


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






