





import math




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     bool:
  assert isinstance(_A	,		_A	) and (
      number >= 0
  ), "'number' must been an int and positive"

  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or not number % 2:
    # Negatives, 0, 1 and all even numbers are not primes
    return False

  lowercase__			    =						range(3	,		int(math.sqrt(_A	) + 1	)	,		2	)
  return not any(not number % i for i in odd_numbers	)




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE=1	,		**_SCREAMING_SNAKE_CASE	)       ->     Any:
  lowercase__			    =						factor * value
  lowercase__			    =						value

  while not is_prime(_A	):
    value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

  if value == first_value_val:
    return next_prime(value + 1	,		**_A	)
  return value









def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE = 50	)       ->     int:
  lowercase__			    =						[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() = }''')


