


"""simple docstring"""



def      UpperCAmelCase     (       _lowercase :   Dict	)						-> Any:


	"""simple docstring"""




	if collection == []:
		return []

	# get some information about the collection
	lowerCAmelCase_      							=			len(_lowercase	)
	lowerCAmelCase_      							=			max(_lowercase	)
	lowerCAmelCase_      							=			min(_lowercase	)

	# create the counting array
	lowerCAmelCase_      							=			coll_max + 1 - coll_min
	lowerCAmelCase_      							=			[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			,   _lowercase	):
		lowerCAmelCase_      							=			counting_arr[i] + counting_arr[i - 1]

	# create the output collection
	lowerCAmelCase_      							=			[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			,   _lowercase	)	):
		lowerCAmelCase_      							=			collection[i]
		counting_arr[collection[i] - coll_min] -= 1

	return ordered
def      UpperCAmelCase     (       _lowercase :   Dict	)						-> List[str]:


	"""simple docstring"""




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


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

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



"""simple docstring"""



def      UpperCAmelCase     (       _lowercase :   int = 1_0_0_0	)						-> int:


	"""simple docstring"""




	lowerCAmelCase_							,	lowerCAmelCase_      							=			1, 1
	lowerCAmelCase_      							=			[]
	for i in range(1			,   n + 1	):
		lowerCAmelCase_      							=			prev_numerator + 2 * prev_denominator
		lowerCAmelCase_      							=			prev_numerator + prev_denominator
		if len(str(_lowercase	)	) > len(str(_lowercase	)	):
			result.append(_lowercase	)
		lowerCAmelCase_      							=			numerator
		lowerCAmelCase_      							=			denominator

	return len(_lowercase	)


if __name__ == "__main__":
		print(f"""{solution() = }""")