

'''simple docstring'''

def 				UpperCamelCase(					UpperCAmelCase_ = 50     ):
 UpperCAmelCase	:     List[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() = }''')







'''simple docstring'''

def 				UpperCamelCase(					UpperCAmelCase_  ,	UpperCAmelCase_     ):
 while a != 0:
  UpperCAmelCase ,			UpperCAmelCase	:     Tuple						 =			b % a, a
 return b




def 				UpperCamelCase(					UpperCAmelCase_  ,	UpperCAmelCase_     ):
 if gcd(UpperCAmelCase_  ,	UpperCAmelCase_     ) != 1:
  UpperCAmelCase	:     List[str]						 =			F"""mod inverse of {a!r} and {m!r} does not exist"""
  raise ValueError(UpperCAmelCase_     )
 UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase	:     Any						 =			1, 0, a
 UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase	:     Dict						 =			0, 1, m
 while va != 0:
  UpperCAmelCase	:     Tuple						 =			ua // va
  UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase ,			UpperCAmelCase	:     List[Any]						 =			(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
 return ua % m




