





from __future__ import annotations

from typing import Any


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__						):
		if not postfix_notation:
				return 0

		lowerCamelCase_	:     Tuple 						=      {'+', '-', '*', '/'}
		lowerCamelCase_	:     list[Any] 						=      []

		for token in postfix_notation:
				if token in operations:
						lowerCamelCase_						,      lowerCamelCase_	:     Optional[int] 						=      stack.pop(), stack.pop()
						if token == "+":
								stack.append(a + b						)
						elif token == "-":
								stack.append(a - b						)
						elif token == "*":
								stack.append(a * b						)
						else:
								if a * b < 0 and a % b != 0:
										stack.append(a // b + 1						)
								else:
										stack.append(a // b						)
				else:
						stack.append(int(lowerCAmelCase__						)						)

		return stack.pop()


if __name__ == "__main__":
		import doctest

		doctest.testmod()







def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__						):
		lowerCamelCase_	:     Union[str, Any] 						=      []
		lowerCamelCase_	:     Tuple 						=      []
		lowerCamelCase_	:     Dict 						=      {
		    '^': 3,
		    '*': 2,
		    '/': 2,
		    '%': 2,
		    '+': 1,
		    '-': 1,
		}  # Priority of each operator
		lowerCamelCase_	:     Optional[int] 						=      len(lowerCAmelCase__						) if (len(lowerCAmelCase__						) > 7) else 7

		# Print table header for output
		print(
		    'Symbol'.center(8						)							,'Stack'.center(lowerCAmelCase__						)							,'Postfix'.center(lowerCAmelCase__						)							,sep=' | '							,)
		print('-' * (print_width * 3 + 7)						)

		for x in infix:
				if x.isalpha() or x.isdigit():
						post_fix.append(lowerCAmelCase__						)  # if x is Alphabet / Digit, add it to Postfix
				elif x == "(":
						stack.append(lowerCAmelCase__						)  # if x is "(" push to Stack
				elif x == ")":  # if x is ")" pop stack until "(" is encountered
						while stack[-1] != "(":
								post_fix.append(stack.pop()						)  # Pop stack & add the content to Postfix
						stack.pop()
				else:
						if len(lowerCAmelCase__						) == 0:
								stack.append(lowerCAmelCase__						)  # If stack is empty, push x to stack
						else:  # while priority of x is not > priority of element in the stack
								while len(lowerCAmelCase__						) > 0 and priority[x] <= priority[stack[-1]]:
										post_fix.append(stack.pop()						)  # pop stack & add to Postfix
								stack.append(lowerCAmelCase__						)  # push x to stack

				print(
				    x.center(8						)							,(''.join(lowerCAmelCase__						)).ljust(lowerCAmelCase__						)							,(''.join(lowerCAmelCase__						)).ljust(lowerCAmelCase__						)							,sep=' | '							,)  # Output in tabular format

		while len(lowerCAmelCase__						) > 0:  # while stack is not empty
				post_fix.append(stack.pop()						)  # pop stack & add to Postfix
				print(
				    ' '.center(8						)							,(''.join(lowerCAmelCase__						)).ljust(lowerCAmelCase__						)							,(''.join(lowerCAmelCase__						)).ljust(lowerCAmelCase__						)							,sep=' | '							,)  # Output in tabular format

		return "".join(lowerCAmelCase__						)  # return Postfix as str


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__						):
		lowerCamelCase_	:     Dict 						=      list(infix[::-1]						)  # reverse the infix equation

		for i in range(len(lowerCAmelCase__						)						):
				if infix[i] == "(":
						lowerCamelCase_	:     str 						=      ')'  # change "(" to ")"
				elif infix[i] == ")":
						lowerCamelCase_	:     Optional[Any] 						=      '('  # change ")" to "("

		return (infix_2_postfix(''.join(lowerCAmelCase__						)						))[
		    ::-1
		]  # call infix_2_postfix on Infix, return reverse of Postfix


if __name__ == "__main__":
		_lowercase		:  int			       =input("""\nEnter an Infix Equation = """)  # Input an Infix equation
		_lowercase		:  Optional[Any]			       ="""""".join(Infix.split())  # Remove spaces from the input
		print("""\n\t""", Infix, """(Infix) -> """, infix_2_prefix(Infix), """(Prefix)""")
