


'''simple docstring'''



def     _UpperCamelCase      (		UpperCamelCase__					):
			if not isinstance(UpperCamelCase__ ,      UpperCamelCase__					):
						raise ValueError("""check_bouncy() accepts only integer arguments"""					)
			UpperCAmelCase__  :					Optional[Any]        =     str(UpperCamelCase__					)
			UpperCAmelCase__  :					Dict        =     """""".join(sorted(UpperCamelCase__					)					)
			return sorted_str_n != str_n and sorted_str_n[::-1] != str_n







def     _UpperCamelCase      (		UpperCamelCase__ = 9_9					):
			if not 0 < percent < 1_0_0:
						raise ValueError("""solution() only accepts values from 0 to 100"""					)
			UpperCAmelCase__  :					str        =     0
			UpperCAmelCase__  :					Optional[int]        =     1

			while True:
						if check_bouncy(UpperCamelCase__					):
									bouncy_num += 1
						if (bouncy_num / num) * 1_0_0 >= percent:
									return num
						num += 1


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		print(f"""{solution(99)}""")



'''simple docstring'''



def     _UpperCamelCase      (		UpperCamelCase__					):
			# if the collection is empty, returns empty
			if collection == []:
						return []

			# get some information about the collection
			UpperCAmelCase__  :					List[str]        =     len(UpperCamelCase__					)
			UpperCAmelCase__  :					Union[str, Any]        =     max(UpperCamelCase__					)
			UpperCAmelCase__  :					Optional[Any]        =     min(UpperCamelCase__					)

			# create the counting array
			UpperCAmelCase__  :					Dict        =     coll_max + 1 - coll_min
			UpperCAmelCase__  :					Optional[int]        =     [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 ,      UpperCamelCase__					):
						UpperCAmelCase__  :					List[str]        =     counting_arr[i] + counting_arr[i - 1]

			# create the output collection
			UpperCAmelCase__  :					Tuple        =     [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 ,      UpperCamelCase__					)					):
						UpperCAmelCase__  :					Any        =     collection[i]
						counting_arr[collection[i] - coll_min] -= 1

			return ordered







def     _UpperCamelCase      (		UpperCamelCase__					):
			return "".join([chr(UpperCamelCase__					) for i in counting_sort([ord(UpperCamelCase__					) for c in string]					)]					)


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

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