

import math



class 						lowercase_					:



      def __init__(    self   :       Union[str, Any]    ,      A__   :       List[Any]    ,      A__   :       Optional[Any]    ,      A__   :       Optional[int]	)					->  str:
        _snake_case		=      x
        _snake_case		=      y
        _snake_case		=      z







      def __repr__(    self   :       Optional[int]	)					->  str:
        return f"""Point({self.x}, {self.y}, {self.z})"""



def    snake_case_(_UpperCamelCase				, _UpperCamelCase  )							->			Optional[int]:



  """simple docstring"""






  return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2  )  )


if __name__ == "__main__":
 import doctest

 doctest.testmod()




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



def    snake_case_(_UpperCamelCase  )							->			str:



  """simple docstring"""






  return c.isdigit()



def    snake_case_(_UpperCamelCase  )							->			str:



  """simple docstring"""






  _snake_case		=							[]

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

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

  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))

