

'''simple docstring'''





from __future__ import annotations

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





@total_ordering
class 		__SCREAMING_SNAKE_CASE       ( lowercase__			):







				def __lt__(					self    :		Dict		,				UpperCAmelCase__    :		Tuple      ):
										'''simple docstring'''
										return self[-1] < other[-1]







				def __eq__(					self    :		Tuple		,				UpperCAmelCase__    :		str      ):
										'''simple docstring'''
										return self[-1] == other[-1]






def 							_lowerCAmelCase (      __magic_name__	:    list	)							->     list:
						lowercase   :       list[Stack]								=[]
						# sort into stacks
						for element in collection:
												lowercase   :       List[Any]								=Stack([element]	)
												lowercase   :       Union[str, Any]								=bisect_left(__magic_name__      ,   __magic_name__	)
												if i != len(__magic_name__	):
																		stacks[i].append(__magic_name__	)
												else:
																		stacks.append(__magic_name__	)

    # use a heap-based merge to merge stack efficiently
						lowercase   :       Tuple								=merge(*(reversed(__magic_name__	) 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))








'''simple docstring'''





def 							_lowerCAmelCase (      __magic_name__	:    int      ,   __magic_name__	:    Optional[Any]	)							->     str:
						lowercase   :       Optional[Any]								=[0 for i in range(r + 1	)]
						# nc0 = 1
						lowercase   :       Optional[Any]								=1
						for i in range(1      ,   n + 1	):
												# to compute current row from previous row.
												lowercase   :       str								=min(__magic_name__      ,   __magic_name__	)
												while j > 0:
																		c[j] += c[j - 1]
																		j -= 1
						return c[r]







print(binomial_coefficient(n=10, r=5))





