
def        a_		(       __lowercase   :	int = 50 ) ->  int:
			_snake_case		=			[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() = }')

from collections.abc import Sequence






def        a_		(       __lowercase   :	Sequence[float]       ,					__lowercase   :	float ) ->  float:
			return sum(c * (x**i) for i, c in enumerate(__lowercase ) )






def        a_		(       __lowercase   :	Sequence[float]       ,					__lowercase   :	float ) ->  float:
			_snake_case		=			0.0
			for coeff in reversed(__lowercase ):
						_snake_case		=			result * x + coeff
			return result


if __name__ == "__main__":
			_lowerCamelCase       :				Optional[Any]       =			(0.0, 0.0, 5.0, 9.3, 7.0)
			_lowerCamelCase       :				Optional[int]       =			1_0.0
			print(evaluate_poly(poly, x))
			print(horner(poly, x))