def 	lowerCamelCase					(	UpperCamelCase     :				int = 10_00							)   ->    int:
		_lowerCamelCase				   =  2**power
		_lowerCamelCase				   =  0
		while n:
				_lowerCamelCase   ,							_lowerCamelCase				   =  r + n % 10, n // 10
		return r


if __name__ == "__main__":
				print(solution(int(str(input()).strip())))
from __future__ import annotations

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





@total_ordering
class     lowerCAmelCase__     (				SCREAMING_SNAKE_CASE_			):


		'''simple docstring'''






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



		def __eq__(       self     :     Tuple     ,  snake_case__     :     Union[str, Any]		)      ->	Union[str, Any]:
				return self[-1] == other[-1]



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

    # use a heap-based merge to merge stack efficiently
		_lowerCamelCase				   =  merge(*(reversed(UpperCamelCase							) 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))