





'''simple docstring'''

from __future__ import annotations

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


@total_ordering
class 					a_     (				snake_case_       ):

    '''simple docstring'''


    def __lt__(		self ,		A       )		->   Tuple:
        return self[-1] < other[-1]





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





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

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


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










'''simple docstring'''

from string import ascii_lowercase, ascii_uppercase





def lowerCamelCase						(     __lowerCamelCase :    str    )						->str:
    if not sentence:
        return ""
    _SCREAMING_SNAKE_CASE									=			dict(zip(__lowerCamelCase					,       __lowerCamelCase    )    )
    return lower_to_upper.get(sentence[0]					,       sentence[0]    ) + sentence[1:]


if __name__ == "__main__":
      from doctest import testmod

      testmod()



