
from __future__ import annotations





def      lowerCamelCase_					(							lowerCamelCase__      ,					lowerCamelCase__      ,					lowerCamelCase__      ,					lowerCamelCase__       ):
				lowerCamelCase_         =     []
				lowerCamelCase_         =     input_list[low:mid], input_list[mid : high + 1]
				while left and right:
								result.append((left if left[0] <= right[0] else right).pop(0       )       )
				lowerCamelCase_         =     result + left + right
				return input_list





def      lowerCamelCase_					(							lowerCamelCase__       ):
				if len(lowerCamelCase__       ) <= 1:
								return input_list
				lowerCamelCase_         =     list(lowerCamelCase__       )

				# iteration for two-way merging
				lowerCamelCase_         =     2
				while p <= len(lowerCamelCase__       ):
								# getting low, high and middle value for merge-sort of single list
								for i in range(0      ,					len(lowerCamelCase__       )      ,					lowerCamelCase__       ):
												lowerCamelCase_         =     i
												lowerCamelCase_         =     i + p - 1
												lowerCamelCase_         =     (low + high + 1) // 2
												lowerCamelCase_         =     merge(lowerCamelCase__      ,					lowerCamelCase__      ,					lowerCamelCase__      ,					lowerCamelCase__       )
								# final merge of last two parts
								if p * 2 >= len(lowerCamelCase__       ):
												lowerCamelCase_         =     i
												lowerCamelCase_         =     merge(lowerCamelCase__      ,					0      ,					lowerCamelCase__      ,					len(lowerCamelCase__       ) - 1       )
												break
								p *= 2

				return input_list


if __name__ == "__main__":
			__A							=input('''Enter numbers separated by a comma:\n''').strip()
			if user_input == "":
						__A							=[]
			else:
						__A							=[int(item.strip()) for item in user_input.split(''',''')]
			print(iter_merge_sort(unsorted))









def    _A	(   lowerCamelCase = 200 ):
   a__						:    List[str]   		=	[1, 2, 5, 10, 20, 50, 100, 200]
   a__						:    Dict   		=	[0] * (pence + 1)
   a__						:    int   		=	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_0_0) == 7_3_6_8_2

