





'''simple docstring'''







import operator as op





def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			Optional[int]   ) ->	Dict:
						UpperCAmelCase_			:      int     						=  []
						UpperCAmelCase_			:      Optional[Any]     						=  lambda SCREAMING_SNAKE_CASE__,			SCREAMING_SNAKE_CASE__   : int(x / y   )  # noqa: E731 integer division operation
						UpperCAmelCase_			:      Optional[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(SCREAMING_SNAKE_CASE__   ))   )

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

																		UpperCAmelCase_			:      int     						=  stack.pop()  # pop stack
																		# output in tabular format
																		print(''''''.rjust(8   ),			('''pop(''' + a + ''')''').ljust(12   ),			''','''.join(SCREAMING_SNAKE_CASE__   ),			sep=''' | '''   )

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

						return int(stack[0]   )


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












'''simple docstring'''







def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			int   ) ->	str:
						if number > 0:
												raise ValueError('''input must be a negative integer'''   )
						UpperCAmelCase_			:      Union[str, Any]     						=  len(bin(SCREAMING_SNAKE_CASE__   )[3:]   )
						UpperCAmelCase_			:      Union[str, Any]     						=  bin(abs(SCREAMING_SNAKE_CASE__   ) - (1 << binary_number_length)   )[3:]
						UpperCAmelCase_			:      Optional[Any]     						=  (
						    (
						        '''1'''
						        + '''0''' * (binary_number_length - len(SCREAMING_SNAKE_CASE__   ))
						        + twos_complement_number
						    )
						    if number < 0
						    else '''0'''
						)
						return "0b" + twos_complement_number


if __name__ == "__main__":
					import doctest

					doctest.testmod()





