
"""simple docstring"""


from collections import deque

from .hash_table import HashTable

class      __a							(UpperCamelCase_):






     '''simple docstring'''

     def __init__(						self	,    *_a	,    **_a  )  ->      Tuple:


           """simple docstring"""


           super().__init__(*UpperCAmelCase__	,    **UpperCAmelCase__  )

     def 					_a			(						self	,    _a	,    _a  )  ->      Optional[Any]:


           """simple docstring"""


           SCREAMING_SNAKE_CASE__   :      List[str]      		=	deque([]  ) if self.values[key] is None else self.values[key]
           self.values[key].appendleft(UpperCAmelCase__  )
           SCREAMING_SNAKE_CASE__   :      int      		=	self.values[key]

     def 					_a			(						self  )  ->      Tuple:


           """simple docstring"""


           return (
               sum(self.charge_factor - len(UpperCAmelCase__  ) for slot in self.values  )
               / self.size_table
               * self.charge_factor
           )





     def 					_a			(						self	,    _a	,    _a=None  )  ->      List[Any]:


           """simple docstring"""


           if not (
               len(self.values[key]  ) == self.charge_factor and self.values.count(UpperCAmelCase__  ) == 0
           ):
                 return key
           return super()._collision_resolution(UpperCAmelCase__	,    UpperCAmelCase__  )







"""simple docstring"""


def  _lowercase					(    __lowerCAmelCase							)       ->				int:
      if divisor % 5 == 0 or divisor % 2 == 0:
            return 0
      SCREAMING_SNAKE_CASE__   :      List[Any]      		=	1
      SCREAMING_SNAKE_CASE__   :      int      		=	1
      while repunit:
            SCREAMING_SNAKE_CASE__   :      str      		=	(10 * repunit + 1) % divisor
            repunit_index += 1
      return repunit_index




def  _lowercase					(    __lowerCAmelCase = 100_0000							)       ->				int:
      SCREAMING_SNAKE_CASE__   :      Dict      		=	limit - 1
      if divisor % 2 == 0:
            divisor += 1
      while least_divisible_repunit(__lowerCAmelCase							) <= limit:
            divisor += 2
      return divisor


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




