


'''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))






def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)							-> float:




    """simple docstring"""




    return price * (1 + tax_rate)


if __name__ == "__main__":
 print(f"{price_plus_tax(100, 0.2_5) = }")
 print(f"{price_plus_tax(1_2_5.5_0, 0.0_5) = }")





