A						=			[4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
A						=			[3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
A						=			{
    0: 'Sunday',
    1: 'Monday',
    2: 'Tuesday',
    3: 'Wednesday',
    4: 'Thursday',
    5: 'Friday',
    6: 'Saturday',
}


def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    str:
		assert len(str(UpperCamelCase							)							) > 2, "year should be in YYYY format"
		assert 1 <= month <= 12, "month should be between 1 to 12"
		assert 1 <= day <= 31, "day should be between 1 to 31"

		# Doomsday algorithm:
		_lowerCamelCase				   =  year // 1_00
		_lowerCamelCase				   =  (5 * (century % 4) + 2) % 7
		_lowerCamelCase				   =  year % 1_00
		_lowerCamelCase				   =  centurian % 12
		_lowerCamelCase				   =  (
		    (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
		) % 7
		_lowerCamelCase				   =  (
		    DOOMSDAY_NOT_LEAP[month - 1]
		    if (year % 4 != 0) or (centurian == 0 and (year % 4_00) == 0)
		    else DOOMSDAY_LEAP[month - 1]
		)
		_lowerCamelCase				   =  (dooms_day + day - day_anchor) % 7
		return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
				import doctest

				doctest.testmod()
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))