



from __future__ import annotations






def 			lowerCAmelCase__	(					lowerCamelCase_	:	Dict ,lowerCamelCase_	:	Any ,lowerCamelCase_	:	Optional[Any] ,lowerCamelCase_	:	str):





    '''simple docstring'''

    lowerCAmelCase__  :       Optional[Any]				=  []
    lowerCAmelCase__  :       Tuple				=  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__  :       str				=  result + left + right
    return input_list






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int):





    '''simple docstring'''

    if len(_lowerCamelCase) <= 1:
        return input_list
    lowerCAmelCase__  :       Dict				=  list(_lowerCamelCase)

    # iteration for two-way merging
    lowerCAmelCase__  :       str				=  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__  :       Any				=  i
            lowerCAmelCase__  :       Optional[int]				=  i + p - 1
            lowerCAmelCase__  :       Optional[Any]				=  (low + high + 1) // 2
            lowerCAmelCase__  :       int				=  merge(_lowerCamelCase ,_lowerCamelCase ,_lowerCamelCase ,_lowerCamelCase)
        # final merge of last two parts
        if p * 2 >= len(_lowerCamelCase):
            lowerCAmelCase__  :       List[Any]				=  i
            lowerCAmelCase__  :       int				=  merge(_lowerCamelCase ,0 ,_lowerCamelCase ,len(_lowerCamelCase) - 1)
            break
        p *= 2

    return input_list


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






def 			lowerCAmelCase__	(					lowerCamelCase_	:	Any ,lowerCamelCase_	:	Optional[Any]):





				'''simple docstring'''

				lowerCAmelCase__  :       str				=  [0 for i in range(r + 1)]
				# nc0 = 1
				lowerCAmelCase__  :       Tuple				=  1
				for i in range(1 ,n + 1):
								# to compute current row from previous row.
								lowerCAmelCase__  :       Optional[int]				=  min(lowerCamelCase_ ,lowerCamelCase_)
								while j > 0:
												c[j] += c[j - 1]
												j -= 1
				return c[r]

print(binomial_coefficient(n=1_0, r=5))

