



"""simple docstring"""







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






	"""simple docstring"""





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

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


if __name__ == "__main__":
			assert solution(200) == 7_3682










'''simple docstring'''






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   str:
      snake_case__      ,							snake_case__       :   Optional[int]	      =    [], []
      while len(__SCREAMING_SNAKE_CASE		) > 1:
            snake_case__      ,							snake_case__       :   Tuple	      =    min(__SCREAMING_SNAKE_CASE		), max(__SCREAMING_SNAKE_CASE		)
            start.append(__SCREAMING_SNAKE_CASE		)
            end.append(__SCREAMING_SNAKE_CASE		)
            collection.remove(__SCREAMING_SNAKE_CASE		)
            collection.remove(__SCREAMING_SNAKE_CASE		)
      end.reverse()
      return start + collection + end


if __name__ == "__main__":
      A_			      =		input("Enter numbers separated by a comma:\n").strip()
      A_			      =		[int(item) for item in user_input.split(",")]
      print(*merge_sort(unsorted), sep=",")
