Go: package main

import (
	"bufio"
	"fmt"
	"go/token"
	"go/types"
	"os"
	"strconv"
	"strings"
)

func main() {
	stdin := bufio.NewScanner(os.Stdin)
	stdin.Scan()
	n, _ := strconv.Atoi(stdin.Text())
	for i := 0; i < n; i++ {
		stdin.Scan()
		exp := strings.TrimRight(stdin.Text(), "=")
		res, _ := types.Eval(token.NewFileSet(), nil, token.NoPos, exp)
		fmt.Println(res.Value)
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cctype>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef string::const_iterator State;
#define rep(i,n) for(int i=0;i<(n);i++)

class Parser{
public:
    int expression(State &begin){
        int ret = term(begin);
        for(;;){
            if(*begin == '+'){
                begin++;
                ret += term(begin);
            }else if(*begin == '-'){
                begin++;
                ret -= term(begin);
            }else{
                break;
            }
        }
        return ret;
    }
    int term(State &begin){
        int ret = factor(begin);
        for(;;){
            if(*begin == '*'){
                begin++;
                ret *= factor(begin);
            }else if(*begin == '/'){
                begin++;
                ret /= factor(begin);
            }else{
                break;
            }
        }
        return ret;
    }
    int factor(State &begin){
        int ret;
        if(*begin == '('){
            begin++;//'('?????????
            ret = expression(begin);
            begin++;//')'?????????
        }else{
            ret = number(begin);
        }
        return ret;
    }
    int number(State &begin){
        int ret = 0;
        while(isdigit(*begin)){
            ret *= 10;
            ret += *begin - '0';
            begin++;
        }
        return ret;
    }
};

int main(void){
    int n; cin >> n;
    rep(i, n){
        Parser ps;
        string s; cin >> s;
        string tmp = s.substr(0, s.size() - 1);
        cout << tmp << endl;
        State begin = s.begin();
        int ret = ps.expression(begin);
        printf("%d\n", ret);
    }
    return 0;
}

C++: // 0109 wa solution?????§
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <stack>
#include <vector>
#include <cctype>
using namespace std;

#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)

void calc(string st, stack<double> &s) {	
	if(st == "*") {
		double a = s.top();
		s.pop();
		double b = s.top();
		s.pop();
		s.push(a * b);
	} else if(st == "+") {
		double a = s.top();
		s.pop();
		double b = s.top();
		s.pop();
		s.push(a + b);
	} else if(st == "-") {
		double a = s.top();
		s.pop();
		double b = s.top();
		s.pop();
		s.push(b - a);
	} else if(st == "/") {
		double a = s.top();
		s.pop();
		double b = s.top();
		s.pop();
		s.push(b / a);
	} else {
		s.push(atof(st.c_str()));
	}
}
int getPriority(string s) {
	if(s == "(") {
		return 5;
	} else if(s == "*" || s == "/") {
		return 3;
	} else if(s == "+" || s == "-") {
		return 2;
	} else if(s == ")") { 
		return 1;
	} else return 4;
}

int main() {
	int n;
	cin >> n;
	while(n--) {
		string str;
		cin >> str;
		str.erase(--str.end());
		
		vector<string> v;
		
		int f = 0;
		char prev = '(';
		bool minus = 0;
		rep(i, str.size()) {		
			if(isdigit(str[i])) {
				f++;
			} else {
				if(f) {
					string st;
					if(minus) {
						st += '-';
						minus = 0;
					}
					rep(j,f) {
						st += str[i - f + j];
					}	
					v.push_back(st);
					string st2;
					st2 += str[i];
					v.push_back(st2);
					f = 0;
				} else {
					if(prev == '(' && str[i] == '-') {
						minus = 1;
						prev = str[i];
						continue;
					}
					string st3;
					st3 += str[i];
					v.push_back(st3);
				}
			}
			prev = str[i];
		}
		if(f) {
			string st;
			rep(j,f) {
				st += str[str.size() - f + j];
			}
			v.push_back(st);
		}

		stack<string> s;
		vector<string> nv;
		stack<double> ret;
		int p = 0;
		rep(i,v.size()) {
			cout << v[i] << endl;
		}
		rep(i,v.size()) {
			p = getPriority(v[i]);
			while(!s.empty() && getPriority(s.top()) > p && s.top() != "(") {
				nv.push_back(s.top());
				s.pop();
			}
			if(v[i] == ")") {
				s.pop();
			} else {
				s.push(v[i]);
			}
		}
		while(!s.empty()) {
			nv.push_back(s.top());
			s.pop();
		}
		rep(i,nv.size()) {
			calc(nv[i], ret);
		}
		cout << ret.top() << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>

//{{{ lex_parser.hpp
#ifndef INCLUDE_LEX_PARSER_HPP
#define INCLUDE_LEX_PARSER_HPP
#include <iostream>
#include <string>
#include <cctype>
namespace orislib {
template<typename T, bool Check=false>
struct LexParser {
  typedef T expr_t;
  typedef std::string::const_iterator state_t;
  LexParser(){}
  expr_t eval(const std::string& expr){
    auto s = std::begin(expr);
    auto r = expression(s);
    consume(s, '=');
    return r;
  }
  void consume(state_t& s, char expected){
    if (!Check || *s == expected){
      s++;
      return;
    }
    std::cerr << "Expected '" << expected << "' but got '" << *s << "'" << std::endl;
    std::cerr << "Rest string is '";
    while (*s) std::cerr << *s;
    std::cerr << "'" << std::endl;
  }
  expr_t number(state_t& s){
    expr_t r = 0;
    while (std::isdigit(*s)){
      r = r * 10 + (*s - '0');
      s++;
    }
    return r;
  }
  expr_t term(state_t& s){
    expr_t r = factor(s);
    while (1){
      if (*s == '*'){
        consume(s, '*');
        r *= factor(s);
      }
      else if (*s == '/'){
        consume(s, '/');
        r /= factor(s);
      }
      else break;
    }
    return r;
  }
  expr_t factor(state_t& s){
    expr_t r;
    if (*s == '('){
      consume(s, '(');
      r = expression(s);
      consume(s, ')');
    }
    else r = number(s);
    return r;
  }
  expr_t expression(state_t& s){
    expr_t r = term(s);
    while (1){
      if (*s == '+'){
        consume(s, '+');
        r += term(s);
      }
      else if (*s == '-'){
        consume(s, '-');
        r -= term(s);
      }
      else break;
    }
    return r;
  }
};
}
#endif
//}}}

using namespace std;
using namespace orislib;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}

inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple

int main()
{
  LexParser<int> parser;
  for (int n = in(); n--;){
    string s;
    cin >> s;
    cout << parser.eval(s) << endl;
  }
  return 0;
}