




from collections import deque

from .hash_table import HashTable

class     __a(	_a  ):






    """simple docstring"""





    def __init__( self  ,*_SCREAMING_SNAKE_CASE  ,**_SCREAMING_SNAKE_CASE    )					->						List[Any]:
         super().__init__(*_SCREAMING_SNAKE_CASE  ,**_SCREAMING_SNAKE_CASE    )





    def 				a__ ( self  ,_SCREAMING_SNAKE_CASE  ,_SCREAMING_SNAKE_CASE    )					->						Tuple:
         UpperCAmelCase_     :				List[Any]  =     deque([]    ) if self.values[key] is None else self.values[key]
         self.values[key].appendleft(_SCREAMING_SNAKE_CASE    )
         UpperCAmelCase_     :				Union[str, Any]  =     self.values[key]





    def 				a__ ( self    )					->						int:
         return (
             sum(self.charge_factor - len(_SCREAMING_SNAKE_CASE    ) for slot in self.values    )
             / self.size_table
             * self.charge_factor
         )





    def 				a__ ( self  ,_SCREAMING_SNAKE_CASE  ,_SCREAMING_SNAKE_CASE=None    )					->						Optional[int]:
         if not (
             len(self.values[key]    ) == self.charge_factor and self.values.count(_SCREAMING_SNAKE_CASE    ) == 0
         ):
              return key
         return super()._collision_resolution(_SCREAMING_SNAKE_CASE  ,_SCREAMING_SNAKE_CASE    )





def lowerCamelCase__  (     ):

     '''simple docstring'''


     UpperCAmelCase_     :				Dict  =     0
     for i in range(1					,		1001 ):
          total += i**i
     return str(_lowercase )[-10:]


if __name__ == "__main__":
     print(solution())