




'''simple docstring'''



import operator as op
def 			SCREAMING_SNAKE_CASE_			(							__A    :			List[str]  )			->			List[Any]:
   _SCREAMING_SNAKE_CASE	=				[]
   _SCREAMING_SNAKE_CASE	=				lambda __A	,					__A  : int(x / y  )  # noqa: E731 integer division operation
   _SCREAMING_SNAKE_CASE	=				{
       "^": 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:
         _SCREAMING_SNAKE_CASE	=				stack.pop()  # pop stack
         # output in tabular format
         print("".rjust(8  )	,					("pop(" + b + ")").ljust(12  )	,					",".join(a_  )	,					sep=" | "  )

         _SCREAMING_SNAKE_CASE	=				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_			=						input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
 print('\n\tResult = ', solve(Postfix))







'''simple docstring'''



lowerCamelCase_			=						'Tobias Carryer'

from time import time







class 		lowercase_   :


   """simple docstring"""

   def __init__(   self :     Tuple  ,				__lowerCamelCase :     int  ,				__lowerCamelCase :     List[Any]  ,				__lowerCamelCase :     Optional[int]  ,				__lowerCamelCase :     Dict=int(time()   )   ):  # noqa: B008

      """simple docstring"""
      _SCREAMING_SNAKE_CASE	=				multiplier
      _SCREAMING_SNAKE_CASE	=				increment
      _SCREAMING_SNAKE_CASE	=				modulo
      _SCREAMING_SNAKE_CASE	=				seed



   def 							lowerCAmelCase_      (   self :     List[str]   ):

      """simple docstring"""
      _SCREAMING_SNAKE_CASE	=				(self.multiplier * self.seed + self.increment) % self.modulo
      return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 lowerCamelCase_			=						LinearCongruentialGenerator(1_66_45_25, 10_13_90_42_23, 2 << 31)
 while True:
  print(lcg.next_number())

