


'''simple docstring'''






from __future__ import annotations

from bisect import bisect_left
from functools import total_ordering
from heapq import merge




@total_ordering
class 						a__							(				a__    ):





							'''simple docstring'''






							def __lt__(						self   ,       lowerCamelCase_  )			->				List[Any]:
														return self[-1] < other[-1]







							def __eq__(						self   ,       lowerCamelCase_  )			->				str:
														return self[-1] == other[-1]


def    _snake_case  (	A			)		->       list:
							lowerCAmelCase__			  =      []
							# sort into stacks
							for element in collection:
														lowerCAmelCase__			  =      Stack([element]			)
														lowerCAmelCase__			  =      bisect_left(A					,       A			)
														if i != len(A			):
																					stacks[i].append(A			)
														else:
																					stacks.append(A			)

    # use a heap-based merge to merge stack efficiently
							lowerCAmelCase__			  =      merge(*(reversed(A			) for stack in stacks)			)
							return collection


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




'''simple docstring'''





def lowerCAmelCase    (__A    ,      __A):



     """simple docstring"""



     if digit_amount > 0:
          return round(number - int(__A)    ,      __A)
     return number - int(__A)


if __name__ == "__main__":
  print(decimal_isolate(1.53, 0))
  print(decimal_isolate(35.345, 1))
  print(decimal_isolate(35.345, 2))
  print(decimal_isolate(35.345, 3))
  print(decimal_isolate(-14.789, 3))
  print(decimal_isolate(0, 2))
  print(decimal_isolate(-14.123, 1))
  print(decimal_isolate(-14.123, 2))
  print(decimal_isolate(-14.123, 3))



