



import operator as op
def  UpperCamelCase						(       _A			:				str    )->       Optional[Any]:





						"""simple docstring"""





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

																		A__							=       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__":
						UpperCAmelCase_							:      Optional[Any]      =  input("\n\nEnter a Postfix Equation (space separated) = ").split(" ")
						print("\n\tResult = ", solve(Postfix))










import math
from collections.abc import Iterator
from itertools import takewhile
def  UpperCamelCase						(       _A			:				int    )->       bool:





						"""simple docstring"""





						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(_A    ) + 1    )			,							6    ):
												if number % i == 0 or number % (i + 2) == 0:
																		return False
						return True
def  UpperCamelCase						(       )->       Iterator[int]:





						"""simple docstring"""





						A__							=       2
						while True:
												if is_prime(_A    ):
																		yield num
												num += 1
def  UpperCamelCase						(       _A			:				int = 2000000    )->       int:





						"""simple docstring"""





						return sum(takewhile(lambda _A    : x < n			,							prime_generator()    )    )


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





