



from collections import defaultdict






def        A       (      _lowerCamelCase       ,				_lowerCamelCase						):





       '''simple docstring'''




       _lowerCAmelCase  :							Dict				     =					first_str.lower().strip()
       _lowerCAmelCase  :							Union[str, Any]				     =					second_str.lower().strip()

       # Remove whitespace
       _lowerCAmelCase  :							List[str]				     =					first_str.replace(" "       ,				""						)
       _lowerCAmelCase  :							int				     =					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()
      _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        A       (      _lowerCamelCase						):





							'''simple docstring'''




							if length <= 0 or not isinstance(_lowerCamelCase       ,				_lowerCamelCase						):
														raise ValueError("Length must be a positive integer."						)
							return [n * (2 * n - 1) for n in range(_lowerCamelCase						)]


if __name__ == "__main__":
						print(hexagonal_numbers(length=5))
						print(hexagonal_numbers(length=10))
