"""simple docstring"""




from collections import defaultdict





def 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: str    ,_lowerCamelCase		: str			) ->   bool:
  _lowerCAmelCase		: List[Any]						    =  first_str.lower().strip()
  _lowerCAmelCase		: Union[str, Any]						    =  second_str.lower().strip()

  # Remove whitespace
  _lowerCAmelCase		: str						    =  first_str.replace(""" """    ,""""""			)
  _lowerCAmelCase		: Any						    =  second_str.replace(""" """    ,""""""			)

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

  # Default values for count should be 0
  _lowerCAmelCase		: defaultdict[str, int]						    =  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   :	Union[str, Any] 					=     input('Enter the first string ').strip()
     _a   :	Union[str, Any] 					=     input('Enter the second string ').strip()

     _a   :	List[str] 					=     check_anagrams(input_a, input_b)
     print(F"""{input_a} and {input_b} are {"" if status else "not "}anagrams.""")





"""simple docstring"""




def 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: int = 1000000			) ->   int:
  _lowerCAmelCase		: List[str]						    =  [i - 1 for i in range(limit + 1			)]

  for i in range(2    ,limit + 1			):
    if phi[i] == i - 1:
      for j in range(2 * i    ,limit + 1    ,_lowerCamelCase			):
        phi[j] -= phi[j] // i

  return sum(phi[2 : limit + 1]			)


if __name__ == "__main__":
     print(solution())




