
import operator as op

def a__    (       A_					):






  '''simple docstring'''





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

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


'''simple docstring'''

def 			__UpperCamelCase       (   UpperCAmelCase     ):
 lowercase__				:    Optional[int]  =					1
 for i in range(1		,     num + 1     ):
  fact *= i
 return fact
def 			__UpperCamelCase       (   UpperCAmelCase     ):
 lowercase__				:    Optional[Any]  =					0
 while number > 0:
  lowercase__				:    str  =					number % 10
  sum_of_digits += last_digit
  lowercase__				:    List[str]  =					number // 10  # Removing the last_digit from the given number
 return sum_of_digits
def 			__UpperCamelCase       (   UpperCAmelCase = 100     ):
 lowercase__				:    Optional[int]  =					factorial(UpperCAmelCase     )
 lowercase__				:    Dict  =					split_and_add(UpperCAmelCase     )
 return result


if __name__ == "__main__":
  print(solution(int(input("""Enter the Number: """).strip())))

