'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					int )			->      list:
							lowercase_					:			Union[str, Any]										=       int(UpperCAmelCase__ )
							if n_element < 1:
														lowercase_					:			Optional[int]										=       ValueError("""a should be a positive number""" )
														raise my_error

							lowercase_					:			Dict										=       [1]
							lowercase_						,						lowercase_						,						lowercase_					:			str										=       (0, 0, 0)
							lowercase_					:			Optional[Any]										=       1
							while index < n_element:
														while hamming_list[i] * 2 <= hamming_list[-1]:
																					i += 1
														while hamming_list[j] * 3 <= hamming_list[-1]:
																					j += 1
														while hamming_list[k] * 5 <= hamming_list[-1]:
																					k += 1
														hamming_list.append(
														    min(hamming_list[i] * 2      ,      hamming_list[j] * 3      ,      hamming_list[k] * 5 ) )
														index += 1
							return hamming_list


if __name__ == "__main__":
						_lowercase						: Union[str, Any]						=						input("Enter the last number (nth term) of the Hamming Number Series: ")
						print("Formula of Hamming Number Series => 2^i * 3^j * 5^k")
						_lowercase						: Optional[int]						=						hamming(int(n))
						print("-----------------------------------------------------")
						print(f"""The list with nth numbers is: {hamming_numbers}""")
						print("-----------------------------------------------------")






'''simple docstring'''




from collections import defaultdict




def 							lowerCamelCase	(      UpperCAmelCase__       :					str      ,      UpperCAmelCase__       :					str )			->      bool:
							lowercase_					:			Tuple										=       first_str.lower().strip()
							lowercase_					:			List[Any]										=       second_str.lower().strip()

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

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

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

							# For each character in input strings,
							# increment count in the corresponding
							for i in range(len(UpperCAmelCase__ ) ):
														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						: int						=						input("Enter the first string ").strip()
						_lowercase						: Tuple						=						input("Enter the second string ").strip()

						_lowercase						: Union[str, Any]						=						check_anagrams(input_a, input_b)
						print(f"""{input_a} and {input_b} are {"" if status else "not "}anagrams.""")





