

"""simple docstring"""




SCREAMING_SNAKE_CASE_     :			List[str]	  =			'''
# Transformers installation
! pip install transformers datasets
# To install from source instead of the last release, comment the command above and uncomment the following one.
# ! pip install git+https://github.com/huggingface/transformers.git
'''

SCREAMING_SNAKE_CASE_     :			Any	  =			[{'''type''': '''code''', '''content''': INSTALL_CONTENT}]
SCREAMING_SNAKE_CASE_     :			List[Any]	  =			{
    '''{processor_class}''': '''FakeProcessorClass''',
    '''{model_class}''': '''FakeModelClass''',
    '''{object_class}''': '''FakeObjectClass''',
}







"""simple docstring"""




import operator as op



def 	UpperCAmelCase__   (				A__   )      ->      Dict:




   """simple docstring"""
   lowerCamelCase__						=			[]
   lowerCamelCase__						=			lambda A__	,    A__   : 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(A__   ))   )

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

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

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

   return int(stack[0]   )


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




