




def 			__magic_name__				( A		:					str   ):






			'''simple docstring'''







			a    =			""
			for ch in key:
						if ch == " " or ch not in key_no_dups and ch.isalpha():
									key_no_dups += ch
			return key_no_dups




def 			__magic_name__				( A		:					str   ):






			'''simple docstring'''







			a    =			[chr(i + 65   ) for i in range(26   )]
			# Remove duplicate characters from key
			a    =			remove_duplicates(key.upper()   )
			a    =			len(A   )
			# First fill cipher with key characters
			a    =			{alphabet[i]: char for i, char in enumerate(A   )}
			# Then map remaining characters in alphabet to
			# the alphabet from the beginning
			for i in range(len(A   ),  26   ):
						a    =			alphabet[i - offset]
						# Ensure we are not mapping letters to letters previously mapped
						while char in key:
									offset -= 1
									a    =			alphabet[i - offset]
						a    =			char
			return cipher_alphabet




def 			__magic_name__				( A		:					str,  A		:					dict[str, str]   ):






			'''simple docstring'''







			return "".join(cipher_map.get(A,  A   ) for ch in message.upper()   )




def 			__magic_name__				( A		:					str,  A		:					dict[str, str]   ):






			'''simple docstring'''







			a    =			{v: k for k, v in cipher_map.items()}
			return "".join(rev_cipher_map.get(A,  A   ) for ch in message.upper()   )




def 			__magic_name__				( ):






			'''simple docstring'''







			a    =			input("Enter message to encode or decode: "   ).strip()
			a    =			input("Enter keyword: "   ).strip()
			a    =			input("Encipher or decipher? E/D:"   ).strip()[0].lower()
			try:
						a    =			{"e": encipher, "d": decipher}[option]
			except KeyError:
						raise KeyError("invalid input option"   )
			a    =			create_cipher_map(A   )
			print(func(A,  A   )   )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		main()














def __A    (      __lowerCAmelCase	)->  list:





						"""simple docstring"""



						if len(__lowerCAmelCase	) < 2:
												return collection

						def circle_sort_util(__lowerCAmelCase ,		__lowerCAmelCase ,		__lowerCAmelCase	) -> bool:
												_UpperCAmelCase									=			False

												if low == high:
																		return swapped

												_UpperCAmelCase									=			low
												_UpperCAmelCase									=			high

												while left < right:
																		if collection[left] > collection[right]:
																								_UpperCAmelCase					, _UpperCAmelCase									=			(
																								    collection[right],
																								    collection[left],
																								)
																								_UpperCAmelCase									=			True

																		left += 1
																		right -= 1

												if left == right and collection[left] > collection[right + 1]:
																		_UpperCAmelCase					, _UpperCAmelCase									=			(
																		    collection[right + 1],
																		    collection[left],
																		)

																		_UpperCAmelCase									=			True

												_UpperCAmelCase									=			low + int((high - low) / 2	)
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		__lowerCAmelCase ,		__lowerCAmelCase	)
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		mid + 1 ,		__lowerCAmelCase	)

												return swapped or left_swap or right_swap

						_UpperCAmelCase									=			True

						while is_not_sorted is True:
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		0 ,		len(__lowerCAmelCase	) - 1	)

						return collection


if __name__ == "__main__":
		_a      	=  input('''Enter numbers separated by a comma:\n''').strip()
		_a      	=  [int(item) for item in user_input.split(''',''')]
		print(circle_sort(unsorted))
