"""simple docstring"""


a							={
    '+': lambda x, y: x + y,
    '-': lambda x, y: x - y,
    '*': lambda x, y: x * y,
    '/': lambda x, y: x / y,
}





def       lowerCamelCase_			( __lowerCAmelCase    )							-> Union[str, Any]:




						'''simple docstring'''



						return c.isdigit()





def       lowerCamelCase_			( __lowerCAmelCase    )							-> Optional[Any]:




						'''simple docstring'''



						lowerCamelCase__ =[]

						# iterate over the string in reverse order
						for c in expression.split()[::-1]:
												# push operand to stack
												if is_operand(__lowerCAmelCase    ):
																		stack.append(int(__lowerCAmelCase    )    )

												else:
																		# pop values from stack can calculate the result
																		# push the result onto the stack again
																		lowerCamelCase__ =stack.pop()
																		lowerCamelCase__ =stack.pop()
																		stack.append(calc[c](__lowerCAmelCase       ,   __lowerCAmelCase    )    )

						return stack.pop()


# Driver code
if __name__ == "__main__":
	a							='+ 9 * 2 6'
	print(evaluate(test_expression))

	a							='/ * 10 2 + 4 1 '
	print(evaluate(test_expression))



"""simple docstring"""


from __future__ import annotations





def       lowerCamelCase_			( __lowerCAmelCase    )							-> int | float:




						'''simple docstring'''



						lowerCamelCase__ =sorted(__lowerCAmelCase    )
						lowerCamelCase__ =len(__lowerCAmelCase    )
						lowerCamelCase__ =length >> 1
						return (
						    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
						    if length % 2 == 0
						    else sorted_list[mid_index]
						)





def       lowerCamelCase_			( )							-> Tuple:




						'''simple docstring'''



						import doctest

						doctest.testmod()


if __name__ == "__main__":
	main()


