

import math
import sys





def a(lowercase__	):





	'''simple docstring'''
	if number != int(lowercase__	):
		raise ValueError('the value of input must be a natural number'	)
	if number < 0:
		raise ValueError('the value of input must not be a negative number'	)
	if number == 0:
		return 1
	snake_case_      		= [-1] * (number + 1)
	snake_case_      		= 0
	for i in range(1			, number + 1	):
		snake_case_      		= sys.maxsize
		snake_case_      		= int(math.sqrt(lowercase__	)	)
		for j in range(1			, root + 1	):
			snake_case_      		= 1 + answers[i - (j**2)]
			snake_case_      		= min(lowercase__			, lowercase__	)
		snake_case_      		= answer
	return answers[number]


if __name__ == "__main__":
						import doctest

						doctest.testmod()



from collections import defaultdict





def a(lowercase__			, lowercase__	):





	'''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(lowercase__	) != len(lowercase__	):
		return False

	# Default values for count should be 0
	snake_case_      		= defaultdict(lowercase__	)

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

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