





'''simple docstring'''






import operator as op







def 					_a						(       _lowerCamelCase ) ->				Tuple:



			"""simple docstring"""


			__snake_case					:      List[Any]							      =     []
			__snake_case					:      Optional[int]							      =     lambda _lowerCamelCase    ,	_lowerCamelCase : int(x / y )  # noqa: E731 integer division operation
			__snake_case					:      List[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					:      List[str]							      =     stack.pop()  # pop stack
									# output in tabular format
									print("""""".rjust(8 )    ,	("""pop(""" + b + """)""").ljust(12 )    ,	""",""".join(_lowerCamelCase )    ,	sep=""" | """ )

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






'''simple docstring'''


import math







def      snake_case_  (    SCREAMING_SNAKE_CASE__	):







				"""simple docstring"""





				assert isinstance(SCREAMING_SNAKE_CASE__				, SCREAMING_SNAKE_CASE__	) and (
				    number >= 0
				), "'number' must been an int and positive"

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

				_SCREAMING_SNAKE_CASE					:			List[str]							= range(3				, int(math.sqrt(SCREAMING_SNAKE_CASE__	) + 1	)				, 2	)
				return not any(not number % i for i in odd_numbers	)







def      snake_case_  (    SCREAMING_SNAKE_CASE__				, SCREAMING_SNAKE_CASE__=1				, **SCREAMING_SNAKE_CASE__	):







				"""simple docstring"""





				_SCREAMING_SNAKE_CASE					:			Dict							= factor * value
				_SCREAMING_SNAKE_CASE					:			Optional[Any]							= value

				while not is_prime(SCREAMING_SNAKE_CASE__	):
								value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

				if value == first_value_val:
								return next_prime(value + 1				, **SCREAMING_SNAKE_CASE__	)
				return value




