
from __future__ import annotations

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




@total_ordering
class     _SCREAMING_SNAKE_CASE     (      snake_case_						):



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



	def __eq__(    self						,  lowercase )				->       int:
					return self[-1] == other[-1]





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			[]
				# sort into stacks
				for element in collection:
								lowerCamelCase_						=			Stack([element]    )
								lowerCamelCase_						=			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
				lowerCamelCase_						=			merge(*(reversed(lowerCamelCase__    ) for stack in stacks)    )
				return collection


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




__A				={str(digit): digit**5 for digit in range(1_0)}





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				return sum(DIGITS_FIFTH_POWER[digit] for digit in str(lowerCamelCase__    )    )





def 			lowerCamelCase_ (				):
				return sum(
				    number
				    for number in range(1_0_0_0	, 1_0_0_0_0_0_0    )
				    if number == digits_fifth_powers_sum(lowerCamelCase__    )    )


if __name__ == "__main__":
			print(solution())


