


from statistics import mean, stdev



def UpperCamelCase_				(				__a			,				__a = 3      )	->   list:
      a__	:  List[str]     =   min(__a      )
      a__	:  str     =   max(__a      )
      # normalize data
      return [round((x - x_min) / (x_max - x_min)			,				__a      ) for x in data]



def UpperCamelCase_				(				__a			,				__a = 3      )	->   list:
      a__	:  str     =   mean(__a      )
      a__	:  List[str]     =   stdev(__a      )
      # standardize data
      return [round((x - mu) / (sigma)			,				__a      ) for x in data]







'''simple docstring'''


from collections import defaultdict
def 						lowerCamelCase__   (				a    ,	a							):
						__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(a							) != len(a							):
												return False

						# Default values for count should be 0
						__snake_case						 =   defaultdict(a							)

						# For each character in input strings,
						# increment count in the corresponding
						for i in range(len(a							)							):
												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.''')

