
'''simple docstring'''
import sys

lowercase__						       =      (
    "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__ = N			)  ->							int:


		'''simple docstring'''


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


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










from __future__ import annotations

import sys
from collections import deque
from typing import Generic, TypeVar

lowercase    				=   TypeVar("T")




class 					UpperCamelCase_ (     Generic[T]							):



	'''simple docstring'''




	lowerCAmelCase						=					42  # Cache store of keys
	lowerCAmelCase						=					42  # References of the keys in cache
	lowerCAmelCase						=					1_0  # Maximum capacity of cache




	def __init__(			self			,     a   )			->       None:
								snake_case_           =				deque()
								snake_case_           =				set()
								if not n:
															snake_case_           =				sys.maxsize
								elif n < 0:
															raise ValueError('n should be an integer greater than 0.'   )
								else:
															snake_case_           =				n




	def 				_UpperCamelCase     (			self			,     a   )			->       None:
								if x not in self.key_reference:
															if len(self.dq_store   ) == LRUCache._MAX_CAPACITY:
																						snake_case_           =				self.dq_store.pop()
																						self.key_reference.remove(a   )
								else:
															self.dq_store.remove(a   )

								self.dq_store.appendleft(a   )
								self.key_reference.add(a   )




	def 				_UpperCamelCase     (			self   )			->       None:
								for k in self.dq_store:
															print(a   )






	def __repr__(			self   )			->       str:
								return F'''LRUCache({self._MAX_CAPACITY}) => {list(self.dq_store   )}'''


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	lowercase    				=   LRUCache(4)
	lru_cache.refer("A")
	lru_cache.refer(2)
	lru_cache.refer(3)
	lru_cache.refer("A")
	lru_cache.refer(4)
	lru_cache.refer(5)
	lru_cache.display()

	print(lru_cache)
	assert str(lru_cache) == "LRUCache(4) => [5, 4, 'A', 3]"





