





import operator as op


def _A       (   __magic_name__	):
   lowercase__			       =  []
   lowercase__			       =  lambda __magic_name__  , __magic_name__	: int(x / y	)  # noqa: E731 integer division operation
   lowercase__			       =  {
       "^": 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:
         lowercase__			       =  stack.pop()  # pop stack
         # output in tabular format
         print("".rjust(8	)  , ("pop(" + b + ")").ljust(12	)  , ",".join(lowerCamelCase__	)  , sep=" | "	)

         lowercase__			       =  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__":
  _snake_case           =			input("""\n\nEnter a Postfix Equation (space separated) = """).split(""" """)
  print("""\n\tResult = """, solve(Postfix))











import math


def _A       (   __magic_name__	):
   lowercase__			       =  math.loga(math.sqrt(4 * positive_integer + 1	) / 2 + 1 / 2	)

   return exponent == int(__magic_name__	)


def _A       (   __magic_name__ = 1 / 1_2345	):
   lowercase__			       =  0
   lowercase__			       =  0

   lowercase__			       =  3
   while True:
      lowercase__			       =  (integer**2 - 1) / 4
      # if candidate is an integer, then there is a partition for k
      if partition_candidate == int(__magic_name__	):
         lowercase__			       =  int(__magic_name__	)
         total_partitions += 1
         if check_partition_perfect(__magic_name__	):
            perfect_partitions += 1
      if perfect_partitions > 0:
         if perfect_partitions / total_partitions < max_proportion:
            return int(__magic_name__	)
      integer += 1


if __name__ == "__main__":
  print(F"""{solution() = }""")






