





import sys

UpperCAmelCase__						:			int									=(
    '''73167176531330624919225119674426574742355349194934'''
    '''96983520312774506326239578318016984801869478851843'''
    '''85861560789112949495459501737958331952853208805511'''
    '''12540698747158523863050715693290963295227443043557'''
    '''66896648950445244523161731856403098711121722383113'''
    '''62229893423380308135336276614282806444486645238749'''
    '''30358907296290491560440772390713810515859307960866'''
    '''70172427121883998797908792274921901699720888093776'''
    '''65727333001053367881220235421809751254540594752243'''
    '''52584907711670556013604839586446706324415722155397'''
    '''53697817977846174064955149290862569321978468622482'''
    '''83972241375657056057490261407972968652414535100474'''
    '''82166370484403199890008895243450658541227588666881'''
    '''16427171479924442928230863465674813919123162824586'''
    '''17866458359124566529476545682848912883142607690042'''
    '''24219022671055626321111109370544217506941658960408'''
    '''07198403850962455444362981230987879927244284909188'''
    '''84580156166097919133875499200524063689912560717606'''
    '''05886116467109405077541002256983155200055935729725'''
    '''71636269561882670428252483600823257530420752963450'''
)





def      _lowercase					(						_UpperCAmelCase				)						->  int:
				lowerCamelCase	 =1
				for digit in s:
								product *= int(_UpperCAmelCase				)
				return product





def      _lowercase					(						_UpperCAmelCase = N				)						->  int:
				lowerCamelCase	 =-sys.maxsize - 1
				lowerCamelCase	 =n[:13]
				lowerCamelCase	 =13
				while cur_index < len(_UpperCAmelCase				) - 13:
								if int(n[cur_index]				) >= int(substr[0]				):
												lowerCamelCase	 =substr[1:] + n[cur_index]
												cur_index += 1
								else:
												lowerCamelCase	 =max(_UpperCAmelCase			,      str_eval(_UpperCAmelCase				)				)
												lowerCamelCase	 =n[cur_index : cur_index + 13]
												cur_index += 13
				return largest_product


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












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





def      _lowercase					(						_UpperCAmelCase				)						->  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      _lowercase					(						)						->  Iterator[int]:
				lowerCamelCase	 =2
				while True:
								if is_prime(_UpperCAmelCase				):
												yield num
								num += 1





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


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





