

def  lowerCamelCase__ (					_a							,			_a):
	SCREAMING_SNAKE_CASE   :      Optional[int]				     =       [0 for i in range(r + 1)]
	# nc0 = 1
	SCREAMING_SNAKE_CASE   :      Optional[Any]				     =       1
	for i in range(1							,			n + 1):
		# to compute current row from previous row.
		SCREAMING_SNAKE_CASE   :      str				     =       min(UpperCAmelCase__							,			UpperCAmelCase__)
		while j > 0:
			c[j] += c[j - 1]
			j -= 1
	return c[r]


print(binomial_coefficient(n=10, r=5))


def  lowerCamelCase__ (					_a = 50):
	SCREAMING_SNAKE_CASE   :      int				     =       [1] * (length + 1)

	for row_length in range(length + 1):
		for tile_length in range(2							,			5):
			for tile_start in range(row_length - tile_length + 1):
				ways_number[row_length] += ways_number[
				    row_length - tile_start - tile_length
				]

	return ways_number[length]


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