


"""simple docstring"""





def    _snake_case  (  _snake_case :	list	):

      def merge(_snake_case :	list       ,      _snake_case :	list	) -> list:

            def _merge():
                  while left and right:
                        yield (left if left[0] <= right[0] else right).pop(0	)
                  yield from left
                  yield from right

            return list(_merge()	)

      if len(_snake_case	) <= 1:
            return collection
      lowerCAmelCase    :		Union[str, Any]				=      len(_snake_case	) // 2
      return merge(merge_sort(collection[:mid]	)       ,      merge_sort(collection[mid:]	)	)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 snake_case__						:   Optional[Any]			 = input('''Enter numbers separated by a comma:\n''').strip()
 snake_case__						:   Union[str, Any]			 = [int(item) for item in user_input.split(''',''')]
 print(*merge_sort(unsorted), sep=''',''')



'''simple docstring'''




import os




def 							lowerCamelCase	(      UpperCAmelCase__       :					str = "input.txt" )			->      int:

							with open(os.path.join(os.path.dirname(UpperCAmelCase__ )      ,      UpperCAmelCase__ ) ) as input_file:
														lowercase_					:			str										=       [
														    [int(UpperCAmelCase__ ) for element in line.split(""",""" )]
														    for line in input_file.readlines()
														]

							lowercase_					:			Optional[Any]										=       len(UpperCAmelCase__ )
							lowercase_					:			Any										=       len(matrix[0] )

							lowercase_					:			Union[str, Any]										=       [[-1 for _ in range(UpperCAmelCase__ )] for _ in range(UpperCAmelCase__ )]
							for i in range(UpperCAmelCase__ ):
														lowercase_					:			int										=       matrix[i][0]

							for j in range(1      ,      UpperCAmelCase__ ):
														for i in range(UpperCAmelCase__ ):
																					lowercase_					:			Union[str, Any]										=       minimal_path_sums[i][j - 1] + matrix[i][j]

														for i in range(1      ,      UpperCAmelCase__ ):
																					lowercase_					:			Tuple										=       min(
																					    minimal_path_sums[i][j]      ,      minimal_path_sums[i - 1][j] + matrix[i][j] )

														for i in range(rows - 2      ,      -1      ,      -1 ):
																					lowercase_					:			Dict										=       min(
																					    minimal_path_sums[i][j]      ,      minimal_path_sums[i + 1][j] + matrix[i][j] )

							return min(minimal_path_sums_row[-1] for minimal_path_sums_row in minimal_path_sums )


if __name__ == "__main__":
						print(f"""{solution() = }""")





