

'''simple docstring'''





import functools






def 							_lowerCAmelCase (      __magic_name__	:    str      ,   __magic_name__	:    str	)							->     int:
						lowercase   :       int								=len(__magic_name__	)
						lowercase   :       List[str]								=len(__magic_name__	)

						@functools.cache
						def min_distance(__magic_name__	:    int      ,   __magic_name__	:    int	) -> int:
												# if first word index is overflow - delete all from the second word
												if indexa >= len_worda:
																		return len_worda - indexa
												# if second word index is overflow - delete all from the first word
												if indexa >= len_worda:
																		return len_worda - indexa
												lowercase   :       str								=int(worda[indexa] != worda[indexa]	)  # current letters not identical
												return min(
												    1 + min_distance(indexa + 1      ,   __magic_name__	)      ,   1 + min_distance(__magic_name__      ,   indexa + 1	)      ,   diff + min_distance(indexa + 1      ,   indexa + 1	)      ,   )

						return min_distance(0      ,   0	)


if __name__ == "__main__":
							import doctest

							doctest.testmod()








'''simple docstring'''





from collections import defaultdict






def 							_lowerCAmelCase (      __magic_name__	:    str      ,   __magic_name__	:    str	)							->     bool:
						lowercase   :       Optional[int]								=first_str.lower().strip()
						lowercase   :       Union[str, Any]								=second_str.lower().strip()

						# Remove whitespace
						lowercase   :       Optional[int]								=first_str.replace(''' '''      ,   ''''''	)
						lowercase   :       Optional[Any]								=second_str.replace(''' '''      ,   ''''''	)

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

						# Default values for count should be 0
						lowercase   :       defaultdict[str, int]								=defaultdict(__magic_name__	)

						# For each character in input strings,
						# increment count in the corresponding
						for i in range(len(__magic_name__	)	):
												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()
							UpperCamelCase_							=					input("""Enter the first string """).strip()
							UpperCamelCase_							=					input("""Enter the second string """).strip()

							UpperCamelCase_							=					check_anagrams(input_a, input_b)
							print(f'''{input_a} and {input_b} are {'' if status else 'not '}anagrams.''')





