'''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.""")






'''simple docstring'''




import operator as op




def 							lowerCamelCase	(      UpperCAmelCase__       :					Optional[Any] )			->      int:
							lowercase_					:			Optional[Any]										=       []
							lowercase_					:			str										=       lambda UpperCAmelCase__      ,      UpperCAmelCase__ : int(x / y )  # noqa: E731 integer division operation
							lowercase_					:			Optional[Any]										=       {
							    """^""": op.pow,
							    """*""": op.mul,
							    """/""": div,
							    """+""": op.add,
							    """-""": op.sub,
							}  # operators & their respective operation

							# print table header
							print("""Symbol""".center(8 )      ,      """Action""".center(12 )      ,      """Stack"""      ,      sep=""" | """ )
							print("""-""" * (30 + len(UpperCAmelCase__ )) )

							for x in post_fix:
														if x.isdigit():  # if x in digit
																					stack.append(UpperCAmelCase__ )  # append x to stack
																					# output in tabular format
																					print(x.rjust(8 )      ,      ("""push(""" + x + """)""").ljust(12 )      ,      """,""".join(UpperCAmelCase__ )      ,      sep=""" | """ )
														else:
																					lowercase_					:			str										=       stack.pop()  # pop stack
																					# output in tabular format
																					print("""""".rjust(8 )      ,      ("""pop(""" + b + """)""").ljust(12 )      ,      """,""".join(UpperCAmelCase__ )      ,      sep=""" | """ )

																					lowercase_					:			Optional[int]										=       stack.pop()  # pop stack
																					# output in tabular format
																					print("""""".rjust(8 )      ,      ("""pop(""" + a + """)""").ljust(12 )      ,      """,""".join(UpperCAmelCase__ )      ,      sep=""" | """ )

																					stack.append(
																					    str(opr[x](int(UpperCAmelCase__ )      ,      int(UpperCAmelCase__ ) ) ) )  # evaluate the 2 values popped from stack & push result to stack
																					# output in tabular format
																					print(
																					    x.rjust(8 )      ,      ("""push(""" + a + x + b + """)""").ljust(12 )      ,      """,""".join(UpperCAmelCase__ )      ,      sep=""" | """      ,      )

							return int(stack[0] )


if __name__ == "__main__":
						_lowercase						: Tuple						=						input("\n\nEnter a Postfix Equation (space separated) = ").split(" ")
						print("\n\tResult = ", solve(Postfix))





