



import operator as op



def        lowerCAmelCase_(   lowercase_     :							Dict							)	->       Dict:
				_lowerCamelCase        =				[]
				_lowerCamelCase        =				lambda lowercase_						,   lowercase_							: 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(lowercase_							))							)

				for x in post_fix:
								if x.isdigit():  # if x in digit
												stack.append(lowercase_							)  # append x to stack
												# output in tabular format
												print(x.rjust(8							)						,   ('''push(''' + x + ''')''').ljust(12							)						,   ''','''.join(lowercase_							)						,   sep=''' | '''							)
								else:
												_lowerCamelCase        =				stack.pop()  # pop stack
												# output in tabular format
												print(''''''.rjust(8							)						,   ('''pop(''' + b + ''')''').ljust(12							)						,   ''','''.join(lowercase_							)						,   sep=''' | '''							)

												_lowerCamelCase        =				stack.pop()  # pop stack
												# output in tabular format
												print(''''''.rjust(8							)						,   ('''pop(''' + a + ''')''').ljust(12							)						,   ''','''.join(lowercase_							)						,   sep=''' | '''							)

												stack.append(
												    str(opr[x](int(lowercase_							)						,   int(lowercase_							)							)							)							)  # 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(lowercase_							)						,   sep=''' | '''						,   )

				return int(stack[0]							)


if __name__ == "__main__":
			__SCREAMING_SNAKE_CASE  :						Union[str, Any]    							=      input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
			print('''\n\tResult = ''', solve(Postfix))





"""simple docstring"""
from __future__ import annotations

from typing import Any



def        lowerCAmelCase_(   lowercase_     :							list[Any]							)	->       None:
				create_state_space_tree(lowercase_						,   []						,   0							)



def        lowerCAmelCase_(   lowercase_     :							list[Any]						,   lowercase_     :							list[Any]						,   lowercase_     :							int							)	->       None:

				if index == len(lowercase_							):
								print(lowercase_							)
								return

				create_state_space_tree(lowercase_						,   lowercase_						,   index + 1							)
				current_subsequence.append(sequence[index]							)
				create_state_space_tree(lowercase_						,   lowercase_						,   index + 1							)
				current_subsequence.pop()


if __name__ == "__main__":
			__SCREAMING_SNAKE_CASE  :						list[Any]    							=      [3, 1, 2, 4]
			generate_all_subsequences(seq)

			seq.clear()
			seq.extend(['''A''', '''B''', '''C'''])
			generate_all_subsequences(seq)
