





import operator as op

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

												_snake_case :			Union[str, Any]  						=   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__":
		lowercase_		:				List[Any]				=						input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
		print('''\n\tResult = ''', solve(Postfix))













import itertools
import math

def       A__(		__lowerCAmelCase ):

				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5	,			int(math.sqrt(__lowerCAmelCase ) + 1 )	,			6 ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def       A__(		):
				_snake_case :			Optional[Any]  						=   2
				while True:
								if is_prime(__lowerCAmelCase ):
												yield num
								num += 1

def       A__(		__lowerCAmelCase = 1_00_01 ):
				return next(itertools.islice(prime_generator()	,			nth - 1	,			__lowerCAmelCase ) )


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






