

def 		_lowercase (     lowercase__ = 5_0						):
      __lowerCAmelCase					:						Optional[Any]					=					[1] * (length + 1)

      for row_length in range(3   ,	length + 1						):
            for block_length in range(3   ,	row_length + 1						):
                  for block_start in range(row_length - block_length						):
                        ways_number[row_length] += ways_number[
                            row_length - block_start - block_length - 1
                        ]

                  ways_number[row_length] += 1

      return ways_number[length]


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





from collections import deque

from .hash_table import HashTable







class   __lowercase      (_UpperCAmelCase ):
 def __init__(							self      ,							*A_      ,							**A_					)					->int:



       '''simple docstring'''





       super().__init__(*A_      ,							**A_					)
 def 	UpperCamelCase__  (							self      ,							A_      ,							A_					)					->Optional[int]:



       '''simple docstring'''





       __lowerCAmelCase					:						Dict					=					deque([]					) if self.values[key] is None else self.values[key]
       self.values[key].appendleft(A_					)
       __lowerCAmelCase					:						int					=					self.values[key]
 def 	UpperCamelCase__  (							self					)					->Tuple:



       '''simple docstring'''





       return (
           sum(self.charge_factor - len(A_					) for slot in self.values					)
           / self.size_table
           * self.charge_factor
       )





 def 	UpperCamelCase__  (							self      ,							A_      ,							A_=None					)					->str:



       '''simple docstring'''





       if not (
           len(self.values[key]					) == self.charge_factor and self.values.count(A_					) == 0
       ):
             return key
       return super()._collision_resolution(A_      ,							A_					)


