






"""simple docstring"""



_UpperCamelCase		:  str						=		{
    '+': lambda x, y: x + y,
    '-': lambda x, y: x - y,
    '*': lambda x, y: x * y,
    '/': lambda x, y: x / y,
}
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  Tuple   ):





  '''simple docstring'''





  return c.isdigit()
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  List[Any]   ):





  '''simple docstring'''





  lowercase							   =	[]

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

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

  return stack.pop()


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

    _UpperCamelCase		:  Optional[Any]						=		'/ * 10 2 + 4 1 '
    print(evaluate(test_expression))










"""simple docstring"""



_UpperCamelCase		:  str						=		1_0**8
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  int   ):





  '''simple docstring'''





  if n % 10 == 0:
    return False
  lowercase							   =	str(__snake_case   )
  return s == s[::-1]
def 						_SCREAMING_SNAKE_CASE			(   ):





  '''simple docstring'''





  lowercase							   =	set()
  lowercase							   =	1
  lowercase							   =	5
  while sum_squares < LIMIT:
    lowercase							   =	first_square + 1
    while sum_squares < LIMIT:
      if is_palindrome(__snake_case   ):
        answer.add(__snake_case   )
      last_square += 1
      sum_squares += last_square**2
    first_square += 1
    lowercase							   =	first_square**2 + (first_square + 1) ** 2

  return sum(__snake_case   )


if __name__ == "__main__":
    print(solution())


