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


def 		_lowerCamelCase       (   _a  ):
  """simple docstring"""




  return c.isdigit()


def 		_lowerCamelCase       (   _a  ):
  """simple docstring"""




  _lowerCamelCase      =						[]

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

    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](a_			,   a_  )  )

  return stack.pop()


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

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









'''simple docstring'''





def     UpperCAmelCase     (    a_      ,		a_		)   ->       set:



   """simple docstring"""






   assert isinstance(a_      ,		a_		), F"The input value of [set_a={set_a}] is not a set"
   assert isinstance(a_      ,		a_		), F"The input value of [set_b={set_b}] is not a set"

   return {a + b for a in set_a for b in set_b}


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

  testmod()
