





from collections import defaultdict



def A_      (						A__						, A__							)    ->						List[Any]:
       a__		:      Tuple					=							first_str.lower().strip()
       a__		:      int					=							second_str.lower().strip()

       # Remove whitespace
       a__		:      Any					=							first_str.replace(' '						, ''							)
       a__		:      List[str]					=							second_str.replace(' '						, ''							)

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

       # Default values for count should be 0
       a__		:      defaultdict[str, int]					=							defaultdict(__snake_case							)

       # For each character in input strings,
       # increment count in the corresponding
       for i in range(len(__snake_case							)							):
              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 :			Any     		=    input("""Enter the first string """).strip()
    lowercase :			List[str]     		=    input("""Enter the second string """).strip()

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






"""simple docstring"""
from math import isqrt, loga

def 				_snake_case      (   __snake_case							:      int   ):




   """simple docstring"""







   _lowerCamelCase	:					List[str]   =		[True] * max_number
   for i in range(2						, isqrt(max_number - 1   ) + 1   ):
      if is_prime[i]:
         for j in range(i**2						, __snake_case						, __snake_case   ):
            _lowerCamelCase	:					Optional[int]   =		False

   return [i for i in range(2						, __snake_case   ) if is_prime[i]]

def 				_snake_case      (   __snake_case							:      int = 800800						, __snake_case							:      int = 800800   ):




   """simple docstring"""







   _lowerCamelCase	:					Union[str, Any]   =		degree * loga(__snake_case   )
   _lowerCamelCase	:					Union[str, Any]   =		int(__snake_case   )
   _lowerCamelCase	:					Dict   =		calculate_prime_numbers(__snake_case   )

   _lowerCamelCase	:					Optional[int]   =		0
   _lowerCamelCase	:					Any   =		0
   _lowerCamelCase	:					Any   =		len(__snake_case   ) - 1
   while left < right:
      while (
          prime_numbers[right] * loga(prime_numbers[left]   )
          + prime_numbers[left] * loga(prime_numbers[right]   )
          > upper_bound
      ):
         right -= 1
      hybrid_integers_count += right - left
      left += 1

   return hybrid_integers_count


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

