




from .hash_table import HashTable




class  __lowerCAmelCase							(				lowerCAmelCase):






       def __init__( self:       Optional[Any]							,       *_lowerCAmelCase:       str							,       **_lowerCAmelCase:       Union[str, Any]					):
         super().__init__(*_lowerCAmelCase							,       **_lowerCAmelCase					)






       def        SCREAMING_SNAKE_CASE     ( self:       int							,       _lowerCAmelCase:       str							,       _lowerCAmelCase:       Optional[int]=None					):
         lowercase     :int   						=    1
         lowercase     :Optional[int]   						=    self.hash_function(key + i * i					)

         while self.values[new_key] is not None and self.values[new_key] != key:
           i += 1
           lowercase     :str   						=    (
               self.hash_function(key + i * i					)
               if not self.balanced_factor() >= self.lim_charge
               else None
           )

           if new_key is None:
             break

         return new_key









import decimal



def    UpperCAmelCase__	(  ):
  lowercase     :int   						=    0
  lowercase     :str   						=    decimal.Context(prec=105 )
  for i in range(2,      100 ):
    lowercase     :int   						=    decimal.Decimal(lowerCamelCase )
    lowercase     :str   						=    number.sqrt(lowerCamelCase )
    if len(str(lowerCamelCase ) ) > 1:
      answer += int(str(lowerCamelCase )[0] )
      lowercase     :int   						=    str(lowerCamelCase )[2:101]
      answer += sum(int(lowerCamelCase ) for x in sqrt_number_str )
  return answer


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(f'''{solution() = }''')



