


'''simple docstring'''
from collections import deque

from .hash_table import HashTable

class     _lowerCamelCase       (     snake_case_					):




 '''simple docstring'''


 def __init__(   self   ,   *__lowercase   ,   **__lowercase    ):

  """simple docstring"""







  super().__init__(*__lowercase   ,   **__lowercase    )


 def 			snake_case__ (   self   ,   __lowercase   ,   __lowercase    ):

  """simple docstring"""







  __A	:		Any	  =      deque([]    ) if self.values[key] is None else self.values[key]
  self.values[key].appendleft(__lowercase    )
  __A	:		Any	  =      self.values[key]


 def 			snake_case__ (   self    ):

  """simple docstring"""







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







 def 			snake_case__ (   self   ,   __lowercase   ,   __lowercase=None    ):

  """simple docstring"""







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










'''simple docstring'''
from math import factorial

UpperCAmelCase_			:  List[str]										=   {str(d): factorial(d) for d in range(1_0)}


def       _lowercase							(					UpperCamelCase__							:       int      ):
 return sum(DIGIT_FACTORIAL[d] for d in str(UpperCamelCase__      )      )


def       _lowercase							(					):
 __A	:		Union[str, Any]	  =      7 * factorial(9      ) + 1
 return sum(i for i in range(3,					UpperCamelCase__      ) if sum_of_digit_factorial(UpperCamelCase__      ) == i      )


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






