
def 			_SCREAMING_SNAKE_CASE      (	_lowerCamelCase				:    int)      ->					int:






							'''simple docstring'''





							assert (
							    isinstance(_lowerCamelCase		,						_lowerCamelCase) and number_of_steps > 0
							), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
							if number_of_steps == 1:
														return 1
							__UpperCamelCase     ,		__UpperCamelCase			:     Any         =      1, 1
							for _ in range(number_of_steps - 1):
														__UpperCamelCase     ,		__UpperCamelCase			:     Union[str, Any]         =      current + previous, current
							return current


if __name__ == "__main__":
		import doctest

		doctest.testmod()

def 			_SCREAMING_SNAKE_CASE      (	_lowerCamelCase				:    int = 200)      ->					int:






							'''simple docstring'''





							__UpperCamelCase			:     Any         =      [1, 2, 5, 10, 20, 50, 100, 200]
							__UpperCamelCase			:     Any         =      [0] * (pence + 1)
							__UpperCamelCase			:     Union[str, Any]         =      1  # base case: 1 way to make 0 pence

							for coin in coins:
														for i in range(_lowerCamelCase		,						pence + 1		,						1):
																					number_of_ways[i] += number_of_ways[i - coin]
							return number_of_ways[pence]


if __name__ == "__main__":
		assert solution(200) == 73682