


'''simple docstring'''
def 			a      (			__a   )  ->	int:



					'''simple docstring'''






					if collection == []:
										return []

					# get some information about the collection
					UpperCamelCase__   :Optional[int]												= len(a__   )
					UpperCamelCase__   :List[str]												= max(a__   )
					UpperCamelCase__   :List[str]												= min(a__   )

					# create the counting array
					UpperCamelCase__   :Union[str, Any]												= coll_max + 1 - coll_min
					UpperCamelCase__   :Union[str, Any]												= [0] * counting_arr_length

					# count how much a number appears in the collection
					for number in collection:
										counting_arr[number - coll_min] += 1

					# sum each position with it's predecessors. now, counting_arr[i] tells
					# us how many elements <= i has in the collection
					for i in range(1 ,					a__   ):
										UpperCamelCase__   :Optional[Any]												= counting_arr[i] + counting_arr[i - 1]

					# create the output collection
					UpperCamelCase__   :Any												= [0] * coll_len

					# place the elements in the output, respecting the original order (stable
					# sort) from end to begin, updating counting_arr
					for i in reversed(range(0 ,					a__   )   ):
										UpperCamelCase__   :Tuple												= collection[i]
										counting_arr[collection[i] - coll_min] -= 1

					return ordered


def 			a      (			__a   )  ->	List[str]:



					'''simple docstring'''






					return "".join([chr(a__   ) for i in counting_sort([ord(a__   ) for c in string]   )]   )


if __name__ == "__main__":
		# Test string sort
		assert counting_sort_string('''thisisthestring''') == "eghhiiinrsssttt"

		__snake_case							      =     input('''Enter numbers separated by a comma:\n''').strip()
		__snake_case							      =     [int(item) for item in user_input.split(''',''')]
		print(counting_sort(unsorted))

from math import ceil


def     __lowerCAmelCase			(			a__ = 1001  )       ->  int:
				__a										=    1

				for i in range(1						,    int(ceil(n / 2.0  )  )  ):
								__a										=    2 * i + 1
								__a										=    2 * i
								__a										=    total + 4 * odd**2 - 6 * even

				return total


if __name__ == "__main__":
					import sys

					if len(sys.argv) == 1:
										print(solution())
					else:
										try:
															A     :	List[Any]    = int(sys.argv[1])
															print(solution(n))
										except ValueError:
															print('Invalid entry - please enter a number')