
from __future__ import annotations



class       _snake_case   :


 def __init__(					self					,  SCREAMING_SNAKE_CASE_=None):


   '''simple docstring'''




   lowercase__  :   List[Any]    		=      data
   lowercase__  :   Tuple    		=      None



 def __repr__(					self):


   '''simple docstring'''




   lowercase__  :   Optional[Any]    		=      []
   lowercase__  :   List[str]    		=      self
   while temp:
     string_rep.append(f'{temp.data}')
     lowercase__  :   int    		=      temp.next
   return "->".join(SCREAMING_SNAKE_CASE_)

def 		UpperCamelCase	(      lowercase_   )		->	Tuple:


  '''simple docstring'''






  if not elements_list:
    raise Exception("""The Elements List is empty"""   )

  lowercase__  :   Dict    		=      Node(elements_list[0]   )
  for i in range(1 , len(lowercase_   )   ):
    lowercase__  :   int    		=      Node(elements_list[i]   )
    lowercase__  :   Union[str, Any]    		=      current.next
  return head

def 		UpperCamelCase	(      lowercase_   )		->	None:


  '''simple docstring'''






  if head_node is not None and isinstance(lowercase_ , lowercase_   ):
    print_reverse(head_node.next   )
    print(head_node.data   )

def 		UpperCamelCase	(      )		->	List[str]:


  '''simple docstring'''






  from doctest import testmod

  testmod()

  lowercase__  :   Dict    		=      make_linked_list([14, 52, 14, 12, 43]   )
  print("""Linked List:"""   )
  print(lowercase_   )
  print("""Elements in Reverse:"""   )
  print_reverse(lowercase_   )


if __name__ == "__main__":
     main()








import sys

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

def 		UpperCamelCase	(      lowercase_ = N   )		->	int:


  '''simple docstring'''






  lowercase__  :   int    		=      -sys.maxsize - 1
  for i in range(len(lowercase_   ) - 12   ):
    lowercase__  :   Optional[int]    		=      1
    for j in range(13   ):
      product *= int(n[i + j]   )
    if product > largest_product:
      lowercase__  :   int    		=      product
  return largest_product


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






