"""simple docstring"""


import operator as op





def      lowerCamelCase_					(   __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						lowerCamelCase__   =[]
						lowerCamelCase__   =lambda __lowerCAmelCase  ,       __lowerCAmelCase							: 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(__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:
																		lowerCamelCase__   =stack.pop()  # pop stack
																		# output in tabular format
																		print("".rjust(8							)  ,       ("pop(" + b + ")").ljust(12							)  ,       ",".join(__lowerCAmelCase							)  ,       sep=" | "							)

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



"""simple docstring"""


def      lowerCamelCase_					(   __lowerCAmelCase							)				->   int:




						'''simple docstring'''



						if not isinstance(__lowerCAmelCase  ,       __lowerCAmelCase							):
												raise TypeError("only integers accepted as input"							)
						else:
												lowerCamelCase__   =str(abs(__lowerCAmelCase							)							)
												lowerCamelCase__   =[list(__lowerCAmelCase							) for char in range(len(__lowerCAmelCase							)							)]
												for index in range(len(__lowerCAmelCase							)							):
																		num_transpositions[index].pop(__lowerCAmelCase							)
												return max(
												    int("".join(list(__lowerCAmelCase							)							)							) for transposition in num_transpositions							)


if __name__ == "__main__":
	__import__('doctest').testmod()


