






import math






def 						a    (		lowerCamelCase_       ):






				'''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 						a    (		lowerCamelCase_ = 1_0001       ):






				'''simple docstring'''

				try:
								lowercase__     				=    int(lowerCamelCase_       )
				except (TypeError, ValueError):
								raise TypeError('''Parameter nth must be int or castable to int.'''       ) from None
				if nth <= 0:
								raise ValueError('''Parameter nth must be greater than or equal to one.'''       )
				lowercase__     				=    []
				lowercase__     				=    2
				while len(lowerCamelCase_       ) < nth:
								if is_prime(lowerCamelCase_       ):
												primes.append(lowerCamelCase_       )
												num += 1
								else:
												num += 1
				return primes[len(lowerCamelCase_       ) - 1]


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












from functools import reduce

A__			:    Union[str, Any]         =				(
    '73167176531330624919225119674426574742355349194934'
    '96983520312774506326239578318016984801869478851843'
    '85861560789112949495459501737958331952853208805511'
    '12540698747158523863050715693290963295227443043557'
    '66896648950445244523161731856403098711121722383113'
    '62229893423380308135336276614282806444486645238749'
    '30358907296290491560440772390713810515859307960866'
    '70172427121883998797908792274921901699720888093776'
    '65727333001053367881220235421809751254540594752243'
    '52584907711670556013604839586446706324415722155397'
    '53697817977846174064955149290862569321978468622482'
    '83972241375657056057490261407972968652414535100474'
    '82166370484403199890008895243450658541227588666881'
    '16427171479924442928230863465674813919123162824586'
    '17866458359124566529476545682848912883142607690042'
    '24219022671055626321111109370544217506941658960408'
    '07198403850962455444362981230987879927244284909188'
    '84580156166097919133875499200524063689912560717606'
    '05886116467109405077541002256983155200055935729725'
    '71636269561882670428252483600823257530420752963450'
)






def 						a    (		lowerCamelCase_ = N       ):






				'''simple docstring'''
				return max(
				    # mypy cannot properly interpret reduce
				    int(reduce(lambda lowerCamelCase_	,     lowerCamelCase_       : str(int(lowerCamelCase_       ) * int(lowerCamelCase_       )       )	,     n[i : i + 13]       )       )
				    for i in range(len(lowerCamelCase_       ) - 12       )       )


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




