
'''simple docstring'''



from collections import defaultdict


def A (__lowerCamelCase :str					,      __lowerCamelCase :str						):
						_lowerCAmelCase    		=					first_str.lower().strip()
						_lowerCAmelCase    		=					second_str.lower().strip()

						# Remove whitespace
						_lowerCAmelCase    		=					first_str.replace(""" """					,      """"""						)
						_lowerCAmelCase    		=					second_str.replace(""" """					,      """"""						)

						# Strings of different lengths are not anagrams
						if len(__lowerCamelCase						) != len(__lowerCamelCase						):
												return False

						# Default values for count should be 0
						_lowerCAmelCase    		=					defaultdict(__lowerCamelCase						)

						# For each character in input strings,
						# increment count in the corresponding
						for i in range(len(__lowerCamelCase						)						):
												count[first_str[i]] += 1
												count[second_str[i]] -= 1

						return all(_count == 0 for _count in count.values()						)


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

						testmod()
						_lowercase          =						input("""Enter the first string """).strip()
						_lowercase          =						input("""Enter the second string """).strip()

						_lowercase          =						check_anagrams(input_a, input_b)
						print(F"""{input_a} and {input_b} are {'' if status else 'not '}anagrams.""")


def   lowerCamelCase__							(							__lowerCAmelCase    :    list							):




			"""simple docstring"""


			for i in range(len(__lowerCAmelCase							) - 1       ,				0       ,				-1							):
						lowerCAmelCase_         =      False

						for j in range(__lowerCAmelCase       ,				0       ,				-1							):
									if unsorted[j] < unsorted[j - 1]:
												lowerCAmelCase_      ,    lowerCAmelCase_         =      unsorted[j - 1], unsorted[j]
												lowerCAmelCase_         =      True

						for j in range(__lowerCAmelCase							):
									if unsorted[j] > unsorted[j + 1]:
												lowerCAmelCase_      ,    lowerCAmelCase_         =      unsorted[j + 1], unsorted[j]
												lowerCAmelCase_         =      True

						if not swapped:
									break
			return unsorted


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			_A  =	input("Enter numbers separated by a comma:\n").strip()
			_A  =	[int(item) for item in user_input.split(",")]
			print(f"""{cocktail_shaker_sort(unsorted) = }""")



