from numpy import exp, pi, sqrt
def 							lowerCAmelCase(     __lowerCamelCase				,    __lowerCamelCase = 0.0				,    __lowerCamelCase = 1.0						):
					return 1 / sqrt(2 * pi * sigma**2						) * exp(-((x - mu) ** 2) / (2 * sigma**2)						)


if __name__ == "__main__":
	import doctest

	doctest.testmod()





from collections import defaultdict
def 							lowerCAmelCase(     __lowerCamelCase				,    __lowerCamelCase						):
					__a		 =       first_str.lower().strip()
					__a		 =       second_str.lower().strip()

					# Remove whitespace
					__a		 =       first_str.replace(' '				,    ''						)
					__a		 =       second_str.replace(' '				,    ''						)

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

					# Default values for count should be 0
					__a		 =       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()
	lowerCamelCase_    :		List[str]							=	input("""Enter the first string """).strip()
	lowerCamelCase_    :		Optional[Any]							=	input("""Enter the second string """).strip()

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




