


'''simple docstring'''






import operator as op





def       lowercase_      (		lowercase__						)   ->Dict:
						_snake_case:   Union[str, Any]  					=		[]
						_snake_case:   Optional[Any]  					=		lambda lowercase__				,  lowercase__						: int(x / y						)  # noqa: E731 integer division operation
						_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:
																		_snake_case:   Dict  					=		stack.pop()  # pop stack
																		# output in tabular format
																		print(''.rjust(8						)				,  ('pop(' + b + ')').ljust(12						)				,  ','.join(_lowerCamelCase						)				,  sep=' | '						)

																		_snake_case:   int  					=		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__":
		A   : Tuple             =			input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
		print('\n\tResult = ', solve(Postfix))












'''simple docstring'''






def       lowercase_      (		lowercase__ = 50						)   ->int:
						_snake_case:   Union[str, Any]  					=		[[0] * 3 for _ in range(length + 1						)]

						for row_length in range(length + 1						):
												for tile_length in range(2				,  5						):
																		for tile_start in range(row_length - tile_length + 1						):
																								different_colour_ways_number[row_length][tile_length - 2] += (
																								    different_colour_ways_number[row_length - tile_start - tile_length][
																								        tile_length - 2
																								    ]
																								    + 1
																								)

						return sum(different_colour_ways_number[length]						)


if __name__ == "__main__":
		print(F'{solution() = }')





