


from collections import defaultdict





def 						_lowerCAmelCase							(     _lowerCAmelCase   ,						_lowerCAmelCase			)    ->						bool:


						'''simple docstring'''






						__snake_case				=		first_str.lower().strip()
						__snake_case				=		second_str.lower().strip()

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

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

						# Default values for count should be 0
						__snake_case				=		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()
	A				:       Optional[int]      =  input('Enter the first string ').strip()
	A				:       int      =  input('Enter the second string ').strip()

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









def 						_lowerCAmelCase							(     _lowerCAmelCase = 100			)    ->						int:


						'''simple docstring'''






						__snake_case				=		n * (n + 1) * (2 * n + 1) / 6
						__snake_case				=		(n * (n + 1) / 2) ** 2
						return int(square_of_sum - sum_of_squares			)


if __name__ == "__main__":
	print(f'''{solution() = }''')





