






'''simple docstring'''



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						str,       SCREAMING_SNAKE_CASE__:						str     )	->      List[str]:

   """simple docstring"""
   assert x is not None
   assert y is not None

   __a					  =     len(SCREAMING_SNAKE_CASE__     )
   __a					  =     len(SCREAMING_SNAKE_CASE__     )

   # declaring the array for storing the dp values
   __a					  =     [[0] * (n + 1) for _ in range(m + 1     )]  # noqa: E741

   for i in range(1,       m + 1     ):
      for j in range(1,       n + 1     ):
         __a					  =     1 if x[i - 1] == y[j - 1] else 0

         __a					  =     max(l[i - 1][j],       l[i][j - 1],       l[i - 1][j - 1] + match     )

   __a					  =     ''
   __a  ,      __a					  =     m, n
   while i > 0 and j > 0:
      __a					  =     1 if x[i - 1] == y[j - 1] else 0

      if l[i][j] == l[i - 1][j - 1] + match:
         if match == 1:
            __a					  =     x[i - 1] + seq
         i -= 1
         j -= 1
      elif l[i][j] == l[i - 1][j]:
         i -= 1
      else:
         j -= 1

   return l[m][n], seq


if __name__ == "__main__":
 __UpperCamelCase   :							Union[str, Any]         =   """AGGTAB"""
 __UpperCamelCase   :							Any         =   """GXTXAYB"""
 __UpperCamelCase   :							Union[str, Any]         =   4
 __UpperCamelCase   :							Union[str, Any]         =   """GTAB"""

 __UpperCamelCase      ,			__UpperCamelCase   :							List[str]         =   longest_common_subsequence(a, b)
 print("""len =""", ln, """, sub-sequence =""", subseq)
 import doctest

 doctest.testmod()







'''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() = }""")