


'''simple docstring'''





import itertools
import string
from collections.abc import Generator, Iterable


def        a__     (					UpperCamelCase_						:      Iterable[str],   UpperCamelCase_						:      int						):
   UpperCAmelCase__	:str      =      iter(UpperCamelCase_						)
   while True:
      UpperCAmelCase__	:Union[str, Any]      =      tuple(itertools.islice(UpperCamelCase_,   UpperCamelCase_						)						)
      if not chunk:
         return
      yield chunk


def        a__     (					UpperCamelCase_						:      str						):
   UpperCAmelCase__	:Any      =      ''''''.join([c.upper() for c in dirty if c in string.ascii_letters]						)
   UpperCAmelCase__	:Any      =      ''''''

   if len(UpperCamelCase_						) < 2:
      return dirty

   for i in range(len(UpperCamelCase_						) - 1						):
      clean += dirty[i]

      if dirty[i] == dirty[i + 1]:
         clean += "X"

   clean += dirty[-1]

   if len(UpperCamelCase_						) & 1:
      clean += "X"

   return clean


def        a__     (					UpperCamelCase_						:      str						):
   # I and J are used interchangeably to allow
   # us to use a 5x5 table (25 letters)
   UpperCAmelCase__	:str      =      '''ABCDEFGHIKLMNOPQRSTUVWXYZ'''
   # we're using a list instead of a '2d' array because it makes the math
   # for setting up the table and doing the actual encoding/decoding simpler
   UpperCAmelCase__	:int      =      []

   # copy key chars into the table if they are in `alphabet` ignoring duplicates
   for char in key.upper():
      if char not in table and char in alphabet:
         table.append(UpperCamelCase_						)

    # fill the rest of the table in with the remaining alphabet chars
   for char in alphabet:
      if char not in table:
         table.append(UpperCamelCase_						)

   return table


def        a__     (					UpperCamelCase_						:      str,   UpperCamelCase_						:      str						):
   UpperCAmelCase__	:List[Any]      =      generate_table(UpperCamelCase_						)
   UpperCAmelCase__	:Union[str, Any]      =      prepare_input(UpperCamelCase_						)
   UpperCAmelCase__	:Dict      =      ''''''

   # https://en.wikipedia.org/wiki/Playfair_cipher#Description
   for chara, chara in chunker(UpperCamelCase_,   2						):
      UpperCAmelCase__   ,						UpperCAmelCase__	:List[Any]      =      divmod(table.index(UpperCamelCase_						),   5						)
      UpperCAmelCase__   ,						UpperCAmelCase__	:str      =      divmod(table.index(UpperCamelCase_						),   5						)

      if rowa == rowa:
         ciphertext += table[rowa * 5 + (cola + 1) % 5]
         ciphertext += table[rowa * 5 + (cola + 1) % 5]
      elif cola == cola:
         ciphertext += table[((rowa + 1) % 5) * 5 + cola]
         ciphertext += table[((rowa + 1) % 5) * 5 + cola]
      else:  # rectangle
         ciphertext += table[rowa * 5 + cola]
         ciphertext += table[rowa * 5 + cola]

   return ciphertext


def        a__     (					UpperCamelCase_						:      str,   UpperCamelCase_						:      str						):
   UpperCAmelCase__	:int      =      generate_table(UpperCamelCase_						)
   UpperCAmelCase__	:Optional[int]      =      ''''''

   # https://en.wikipedia.org/wiki/Playfair_cipher#Description
   for chara, chara in chunker(UpperCamelCase_,   2						):
      UpperCAmelCase__   ,						UpperCAmelCase__	:Tuple      =      divmod(table.index(UpperCamelCase_						),   5						)
      UpperCAmelCase__   ,						UpperCAmelCase__	:List[str]      =      divmod(table.index(UpperCamelCase_						),   5						)

      if rowa == rowa:
         plaintext += table[rowa * 5 + (cola - 1) % 5]
         plaintext += table[rowa * 5 + (cola - 1) % 5]
      elif cola == cola:
         plaintext += table[((rowa - 1) % 5) * 5 + cola]
         plaintext += table[((rowa - 1) % 5) * 5 + cola]
      else:  # rectangle
         plaintext += table[rowa * 5 + cola]
         plaintext += table[rowa * 5 + cola]

   return plaintext







'''simple docstring'''





from functools import reduce

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


def        a__     (					UpperCamelCase_						:      str = N						):
   return max(
       # mypy cannot properly interpret reduce
       int(reduce(lambda UpperCamelCase_,   UpperCamelCase_						: str(int(UpperCamelCase_						) * int(UpperCamelCase_						)						),   n[i : i + 13]						)						)
       for i in range(len(UpperCamelCase_						) - 12						)						)


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



