





'''simple docstring'''






import operator as op
def    UpperCamelCase__      (		lowerCAmelCase  ):





      """simple docstring"""


      _lowerCAmelCase							     =							[]
      _lowerCAmelCase							     =							lambda lowerCAmelCase							,	lowerCAmelCase  : int(x / y  )  # noqa: E731 integer division operation
      _lowerCAmelCase							     =							{
          """^""": 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(lowerCAmelCase  ))  )

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

                  _lowerCAmelCase							     =							stack.pop()  # pop stack
                  # output in tabular format
                  print("""""".rjust(8  )							,	("""pop(""" + a + """)""").ljust(12  )							,	""",""".join(lowerCAmelCase  )							,	sep=""" | """  )

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

      return int(stack[0]  )


if __name__ == "__main__":
      A__				:   Optional[Any]      =input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
      print('''\n\tResult = ''', solve(Postfix))










from __future__ import annotations







def        _lowerCamelCase(	lowercase__	)						->	list[int]:

		'''simple docstring'''







		__lowercase=			2
		__lowercase=			[]
		while i * i <= n:
				if n % i:
						i += 1
				else:
						n //= i
						factors.append(lowercase__	)
		if n > 1:
				factors.append(lowercase__	)
		return factors


if __name__ == "__main__":
	import doctest

	doctest.testmod()






