


from collections import defaultdict






def 		lowercase_(  SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  lowerCamelCase :					Dict    =				first_str.lower().strip()
  lowerCamelCase :					Optional[Any]    =				second_str.lower().strip()

  # Remove whitespace
  lowerCamelCase :					Optional[Any]    =				first_str.replace(" "      ,						""	)
  lowerCamelCase :					List[Any]    =				second_str.replace(" "      ,						""	)

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

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

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

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







def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  lowerCamelCase :					List[Any]    =				1
  lowerCamelCase :					Union[str, Any]    =				1
  while repunit:
    lowerCamelCase :					Union[str, Any]    =				(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index






def 		lowercase_(  SCREAMING_SNAKE_CASE_ = 1000000	):


  '''simple docstring'''

  lowerCamelCase :					List[str]    =				limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(SCREAMING_SNAKE_CASE_	) <= limit:
    divisor += 2
  return divisor


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



