
import operator as op


def    A (      lowercase				)     ->						str:
		'''simple docstring'''

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

						UpperCamelCase						=  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__":
					_UpperCAmelCase      :				Optional[int]          = input("\n\nEnter a Postfix Equation (space separated) = ").split(" ")
					print("\n\tResult = ", solve(Postfix))


def    A (      lowercase				)     ->						str:
		'''simple docstring'''

		UpperCamelCase						=  int(lowercase				)
		if decimal in (0, 1):  # Exit cases for the recursion
				return str(lowercase				)
		UpperCamelCase			,						UpperCamelCase						=  divmod(lowercase					, 2				)
		return binary_recursive(lowercase				) + str(lowercase				)


def    A (      lowercase				)     ->						str:
		'''simple docstring'''

		UpperCamelCase						=  str(lowercase				).strip()
		if not number:
				raise ValueError('No input value was provided'				)
		UpperCamelCase						=  '-' if number.startswith('-'				) else ''
		UpperCamelCase						=  number.lstrip('-'				)
		if not number.isnumeric():
				raise ValueError('Input value is not an integer'				)
		return f'''{negative}0b{binary_recursive(int(lowercase				)				)}'''


if __name__ == "__main__":
					from doctest import testmod

					testmod()
