




'''simple docstring'''


import math
import unittest
def 						lowerCamelCase__   (				a							):
						assert isinstance(SCREAMING_SNAKE_CASE__    ,	SCREAMING_SNAKE_CASE__							) and (
						    number >= 0
						), "'number' must been an int and positive"

						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(SCREAMING_SNAKE_CASE__							) + 1							)    ,	6							):
												if number % i == 0 or number % (i + 2) == 0:
																		return False
						return True
class 						a_				(			unittest.TestCase						):




	def   lowercase__   (       self     :  str      ):
							self.assertTrue(is_prime(2      )      )
							self.assertTrue(is_prime(3      )      )
							self.assertTrue(is_prime(5      )      )
							self.assertTrue(is_prime(7      )      )
							self.assertTrue(is_prime(1_1      )      )
							self.assertTrue(is_prime(1_3      )      )
							self.assertTrue(is_prime(1_7      )      )
							self.assertTrue(is_prime(1_9      )      )
							self.assertTrue(is_prime(2_3      )      )
							self.assertTrue(is_prime(2_9      )      )




	def   lowercase__   (       self     :  str      ):
							with self.assertRaises(__lowerCAmelCase      ):
													is_prime(-1_9      )
							self.assertFalse(
							    is_prime(0      )       ,		'Zero doesn\'t have any positive factors, primes must have exactly two.'       ,		)
							self.assertFalse(
							    is_prime(1      )       ,		'One only has 1 positive factor, primes must have exactly two.'       ,		)
							self.assertFalse(is_prime(2 * 2      )      )
							self.assertFalse(is_prime(2 * 3      )      )
							self.assertFalse(is_prime(3 * 3      )      )
							self.assertFalse(is_prime(3 * 5      )      )
							self.assertFalse(is_prime(3 * 5 * 7      )      )


if __name__ == "__main__":
	unittest.main()









'''simple docstring'''



import sys

__UpperCamelCase   :							List[str]         =   (
    """73167176531330624919225119674426574742355349194934"""
    """96983520312774506326239578318016984801869478851843"""
    """85861560789112949495459501737958331952853208805511"""
    """12540698747158523863050715693290963295227443043557"""
    """66896648950445244523161731856403098711121722383113"""
    """62229893423380308135336276614282806444486645238749"""
    """30358907296290491560440772390713810515859307960866"""
    """70172427121883998797908792274921901699720888093776"""
    """65727333001053367881220235421809751254540594752243"""
    """52584907711670556013604839586446706324415722155397"""
    """53697817977846174064955149290862569321978468622482"""
    """83972241375657056057490261407972968652414535100474"""
    """82166370484403199890008895243450658541227588666881"""
    """16427171479924442928230863465674813919123162824586"""
    """17866458359124566529476545682848912883142607690042"""
    """24219022671055626321111109370544217506941658960408"""
    """07198403850962455444362981230987879927244284909188"""
    """84580156166097919133875499200524063689912560717606"""
    """05886116467109405077541002256983155200055935729725"""
    """71636269561882670428252483600823257530420752963450"""
)



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						str = N     )	->      int:

   """simple docstring"""
   __a					  =     -sys.maxsize - 1
   for i in range(len(SCREAMING_SNAKE_CASE__     ) - 12     ):
      __a					  =     1
      for j in range(13     ):
         product *= int(n[i + j]     )
      if product > largest_product:
         __a					  =     product
   return largest_product


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