'''simple docstring'''

import operator as op



def snake_case_      (					__snake_case  :							Tuple)			->					Optional[int]:
   lowerCAmelCase_			=      []
   lowerCAmelCase_			=      lambda __snake_case	,   __snake_case: 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(__snake_case)))

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

         lowerCAmelCase_			=      stack.pop()  # pop stack
         # output in tabular format
         print(''''''.rjust(8)	,   ('''pop(''' + a + ''')''').ljust(12)	,   ''','''.join(__snake_case)	,   sep=''' | ''')

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

   return int(stack[0])


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






'''simple docstring'''

def snake_case_      (					__snake_case  :							int = 200)			->					int:
   lowerCAmelCase_			=      [1, 2, 5, 10, 20, 50, 100, 200]
   lowerCAmelCase_			=      [0] * (pence + 1)
   lowerCAmelCase_			=      1  # base case: 1 way to make 0 pence

   for coin in coins:
      for i in range(__snake_case	,   pence + 1	,   1):
         number_of_ways[i] += number_of_ways[i - coin]
   return number_of_ways[pence]


if __name__ == "__main__":
 assert solution(2_00) == 7_36_82





