





"""simple docstring"""





from .hash_table import HashTable

class 		lowercase ( lowerCAmelCase_ ):





      def __init__(	self				,						*lowercase				,						**lowercase			)		->					int:
            super().__init__(*_snake_case				,						**_snake_case			)





      def    _snake_case      (	self				,						lowercase				,						lowercase=None			)		->					Tuple:
            lowerCAmelCase  						=	1
            lowerCAmelCase  						=	self.hash_function(key + i * i			)

            while self.values[new_key] is not None and self.values[new_key] != key:
                  i += 1
                  lowerCAmelCase  						=	(
                      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













"""simple docstring"""





def       UpperCAmelCase__							(  SCREAMING_SNAKE_CASE					:						int							,						SCREAMING_SNAKE_CASE					:						int      ):







      '''simple docstring'''




      lowerCAmelCase  						=	1.0
      for i in range(1							,						r + 1      ):
            ret *= (n + 1 - i) / i
      return round(SCREAMING_SNAKE_CASE      )


def       UpperCAmelCase__							(  SCREAMING_SNAKE_CASE					:						int      ):







      '''simple docstring'''




      return choose(8 + n							,						SCREAMING_SNAKE_CASE      ) + choose(9 + n							,						SCREAMING_SNAKE_CASE      ) - 10


def       UpperCAmelCase__							(  SCREAMING_SNAKE_CASE					:						int      ):







      '''simple docstring'''




      return sum(non_bouncy_exact(SCREAMING_SNAKE_CASE      ) for i in range(1							,						n + 1      )      )


def       UpperCAmelCase__							(  SCREAMING_SNAKE_CASE					:						int = 1_00      ):







      '''simple docstring'''




      return non_bouncy_upto(SCREAMING_SNAKE_CASE      )


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






