



"""simple docstring"""
from collections import defaultdict


def 			_SCREAMING_SNAKE_CASE						(__lowerCAmelCase ,  __lowerCAmelCase							) ->						bool:







  '''simple docstring'''


  lowercase_								= first_str.lower().strip()
  lowercase_								= second_str.lower().strip()

  # Remove whitespace
  lowercase_								= first_str.replace(""" """ ,  """"""							)
  lowercase_								= second_str.replace(""" """ ,  """"""							)

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

  # Default values for count should be 0
  lowercase_								= 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()
  UpperCAmelCase						:		Tuple			= input("Enter the first string ").strip()
  UpperCAmelCase						:		List[str]			= input("Enter the second string ").strip()

  UpperCAmelCase						:		Optional[int]			= 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=2_81_23							) ->						Optional[Any]:







  '''simple docstring'''


  lowercase_								= [1] * (limit + 1)

  for i in range(2 ,  int(limit**0.5							) + 1							):
    sum_divs[i * i] += i
    for k in range(i + 1 ,  limit // i + 1							):
      sum_divs[k * i] += k + i

  lowercase_								= set()
  lowercase_								= 0

  for n in range(1 ,  limit + 1							):
    if sum_divs[n] > n:
      abundants.add(__lowerCAmelCase							)

    if not any((n - a in abundants) for a in abundants							):
      res += n

  return res


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

