import string




def 				UpperCamelCase						(       __lowercase						: Any	):
		'''simple docstring'''




		A_		:				Tuple     =      ''
		for i in sequence:
				A_		:				List[Any]     =      ord(lowercase__	)
				if 65 <= extract <= 90:
						output += chr(1_55 - extract	)
				elif 97 <= extract <= 1_22:
						output += chr(2_19 - extract	)
				else:
						output += i
		return output




def 				UpperCamelCase						(       __lowercase						: int	):
		'''simple docstring'''




		A_		:				Tuple     =      string.ascii_letters
		A_		:				Optional[int]     =      string.ascii_lowercase[::-1] + string.ascii_uppercase[::-1]
		return "".join(
		    letters_reversed[letters.index(lowercase__	)] if c in letters else c for c in sequence	)




def 				UpperCamelCase						(       ):
		'''simple docstring'''




		from timeit import timeit

		print('Running performance benchmarks...'	)
		A_		:				List[Any]     =      'from string import printable ; from __main__ import atbash, atbash_slow'
		print(f'''> atbash_slow(): {timeit('atbash_slow(printable)'						,setup=lowercase__	)} seconds'''	)
		print(f'''>      atbash(): {timeit('atbash(printable)'						,setup=lowercase__	)} seconds'''	)


if __name__ == "__main__":
	for example in ("ABCDEFGH", "123GGjj", "testStringtest", "with space"):
		print(F"""{example} encrypted in atbash: {atbash(example)}""")
	benchmark()










def        _lowerCamelCase(	lowercase__	)						->	int:

		'''simple docstring'''







		if collection == []:
				return []

		# get some information about the collection
		__lowercase=			len(lowercase__	)
		__lowercase=			max(lowercase__	)
		__lowercase=			min(lowercase__	)

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

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

		return ordered







def        _lowerCamelCase(	lowercase__	)						->	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"

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






