code: 
  from .hash_table import HashTable
  
  
  
  
  
  class    _snake_case      (  A__       ):
  
  
  
  
  
  
  
  			def __init__(       self		,     *_a		,     **_a	):
  				super().__init__(*_a		,     **_a	)
  
  
  
  
  
  
  
  			def     SCREAMING_SNAKE_CASE					(       self		,     _a		,     _a=None	):
  				__magic_name__	:	int			     =  1
  				__magic_name__	:	List[Any]			     =  self.hash_function(key + i * i	)
  
  				while self.values[new_key] is not None and self.values[new_key] != key:
  					i += 1
  					__magic_name__	:	List[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
  
  
  
  
  
  
style_context: 
  from __future__ import annotations
  
  snake_case				:	List[str]							   =						"Alexander Joslin"
  
  
  
  
  
  
  def 						lowerCAmelCase_		(      _snake_case   :						int     )       ->	int:
  
  
  
  
  
  
  
  	'''simple docstring'''
  
  
  	if number <= 0:
  		__magic_name__	:	int			     =  F'''n must be greater than 0. Got n = {number}'''
  		raise ValueError(_snake_case     )
  
  	__magic_name__	:	List[str]			     =  [number + 1] * (number + 1)
  
  	# starting position
  	__magic_name__	:	Any			     =  0
  	for i in range(1   ,     _snake_case     ):
  		__magic_name__	:	Optional[int]			     =  min(table[i + 1]   ,     table[i] + 1     )
  		# check if out of bounds
  		if i * 2 <= number:
  			__magic_name__	:	str			     =  min(table[i * 2]   ,     table[i] + 1     )
  		# check if out of bounds
  		if i * 3 <= number:
  			__magic_name__	:	Any			     =  min(table[i * 3]   ,     table[i] + 1     )
  	return table[number]
  
  
  if __name__ == "__main__":
  				import doctest
  
  				doctest.testmod()
  