



'''simple docstring'''




import operator as op


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

						__SCREAMING_SNAKE_CASE :	Union[str, Any]					 =	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__":
						UpperCamelCase__ :			Tuple												=				input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
						print('''\n\tResult = ''', solve(Postfix))




'''simple docstring'''




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


if __name__ == "__main__":
						import doctest

						doctest.testmod()