






import operator as op

def    SCREAMING_SNAKE_CASE_							(							__magic_name__					:  Tuple					)		->			int:






	"""simple docstring"""



	UpperCamelCase     :Dict          =	[]
	UpperCamelCase     :Union[str, Any]          =	lambda __magic_name__	,			__magic_name__					: int(x / y					)  # noqa: E731 integer division operation
	UpperCamelCase     :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(__magic_name__					))					)

	for x in post_fix:
		if x.isdigit():  # if x in digit
			stack.append(__magic_name__					)  # append x to stack
			# output in tabular format
			print(x.rjust(8					)	,			("""push(""" + x + """)""").ljust(12					)	,			""",""".join(__magic_name__					)	,			sep=""" | """					)
		else:
			UpperCamelCase     :List[Any]          =	stack.pop()  # pop stack
			# output in tabular format
			print("""""".rjust(8					)	,			("""pop(""" + b + """)""").ljust(12					)	,			""",""".join(__magic_name__					)	,			sep=""" | """					)

			UpperCamelCase     :Union[str, Any]          =	stack.pop()  # pop stack
			# output in tabular format
			print("""""".rjust(8					)	,			("""pop(""" + a + """)""").ljust(12					)	,			""",""".join(__magic_name__					)	,			sep=""" | """					)

			stack.append(
			    str(opr[x](int(__magic_name__					)	,			int(__magic_name__					)					)					)					)  # 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(__magic_name__					)	,			sep=""" | """	,			)

	return int(stack[0]					)


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




'''simple docstring'''

from __future__ import annotations

from fractions import Fraction





def __snake_case					(      UpperCAmelCase_						:						int					,				UpperCAmelCase_						:						int		):
 return (
     num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
 )





def __snake_case					(      UpperCAmelCase_						:						int		):
 lowerCamelCase_      =  []
 lowerCamelCase_      =  11
 lowerCamelCase_      =  int("1" + "0" * digit_len		)
 for num in range(UpperCAmelCase_					,				UpperCAmelCase_		):
  while den <= 99:
   if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
    if is_digit_cancelling(UpperCAmelCase_					,				UpperCAmelCase_		):
     solutions.append(F'''{num}/{den}'''		)
   den += 1
  num += 1
  lowerCamelCase_      =  10
 return solutions





def __snake_case					(      UpperCAmelCase_						:						int = 2		):
 lowerCamelCase_      =  1.0
 for fraction in fraction_list(UpperCAmelCase_		):
  lowerCamelCase_      =  Fraction(UpperCAmelCase_		)
  result *= frac.denominator / frac.numerator
 return int(UpperCAmelCase_		)


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



