

from .hash_table import HashTable
from .number_theory.prime_numbers import is_prime, next_prime



class 		a_	(							UpperCAmelCase__					):



      """simple docstring"""







      def __init__(				self					:							Dict      ,*snake_case					:							str      ,**snake_case					:							Tuple    ):
           super().__init__(*snake_case      ,**snake_case    )
      def 	_lowerCAmelCase					(				self					:							Dict      ,snake_case					:							Any      ,snake_case					:							str    ):
           SCREAMING_SNAKE_CASE										=(
               next_prime(value % self.size_table    )
               if not is_prime(value % self.size_table    )
               else value % self.size_table
           )  # gt = bigger than
           return next_prime_gt - (data % next_prime_gt)
      def 	_lowerCAmelCase					(				self					:							List[Any]      ,snake_case					:							List[Any]      ,snake_case					:							List[str]      ,snake_case					:							List[str]    ):
           return (increment * self.__hash_function_a(snake_case      ,snake_case    )) % self.size_table


      def 	_lowerCAmelCase					(				self					:							Tuple      ,snake_case					:							str      ,snake_case					:							Union[str, Any]=None    ):
           SCREAMING_SNAKE_CASE										=1
           SCREAMING_SNAKE_CASE										=self.hash_function(snake_case    )

           while self.values[new_key] is not None and self.values[new_key] != key:
                SCREAMING_SNAKE_CASE										=(
                    self.__hash_double_function(snake_case      ,snake_case      ,snake_case    )
                    if self.balanced_factor() >= self.lim_charge
                    else None
                )
                if new_key is None:
                     break
                else:
                     i += 1

           return new_key




import decimal







def       snake_case__    (       ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=0
     SCREAMING_SNAKE_CASE										=decimal.Context(prec=105      )
     for i in range(2,   100      ):
          SCREAMING_SNAKE_CASE										=decimal.Decimal(lowerCAmelCase_      )
          SCREAMING_SNAKE_CASE										=number.sqrt(lowerCAmelCase_      )
          if len(str(lowerCAmelCase_      )      ) > 1:
               answer += int(str(lowerCAmelCase_      )[0]      )
               SCREAMING_SNAKE_CASE										=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() = }')

