


'''simple docstring'''





def 							__lowercase     (				__lowerCAmelCase							:       str     ):
							return " ".join(
							    ''.join(word[::-1]     ) if len(__lowerCAmelCase     ) > 4 else word for word in sentence.split()     )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						print(reverse_long_words('''Hey wollef sroirraw'''))








def 							__lowercase     (				__lowerCAmelCase							:       int = 2_0_0     ):
							a__    =  [1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
							a__    =  [0] * (pence + 1)
							a__    =  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(2_00) == 7_36_82




