

"""simple docstring"""






def  UpperCamelCase   (     _lowerCAmelCase       :  list[int]	)			->     int:

	# validate:
	if not isinstance(_lowerCAmelCase,					_lowerCAmelCase	) or not all(
	    isinstance(_lowerCAmelCase,					_lowerCAmelCase	) and item >= 0 for item in citations	):
		raise ValueError("""The citations should be a list of non negative integers."""	)

	citations.sort()
	_UpperCAmelCase      :							Optional[int]       =   len(_lowerCAmelCase	)

	for i in range(_lowerCAmelCase	):
		if citations[len_citations - 1 - i] <= i:
			return i

	return len_citations


if __name__ == "__main__":
						import doctest

						doctest.testmod()








"""simple docstring"""






def  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     str:
	_UpperCAmelCase      :							Any       =   len(_lowerCAmelCase	)
	for _ in range(
	    0,					int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
		for j in range(0,					no_of_elements - 1	):
			if (
			    lst[j + 1] < lst[j]
			):  # applying bubble sort algorithm from left to right (or forwards)
				_UpperCAmelCase      :							List[str]       =   lst[j + 1]
				_UpperCAmelCase      :							Optional[int]       =   lst[j]
				_UpperCAmelCase      :							Optional[int]       =   temp
			if (
			    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
			):  # applying bubble sort algorithm from right to left (or backwards)
				_UpperCAmelCase      :							Any       =   lst[no_of_elements - 1 - j]
				_UpperCAmelCase      :							Optional[Any]       =   lst[no_of_elements - 2 - j]
				_UpperCAmelCase      :							Optional[Any]       =   temp
	return lst


if __name__ == "__main__":
						print('''enter the list to be sorted''')
						lowerCamelCase__			:					List[str]							  =					[int(x) for x in input().split()]  # inputing elements of the list in one line
						lowerCamelCase__			:					int							  =					double_sort(lst)
						print('''the sorted list is''')
						print(sorted_lst)





