#include <bits/stdc++.h>
using namespace std;int prio(char x)  //定义优先级
{switch (x){case '+': return 1;case '-': return 1;case '*': return 2;case '/': return 2;default : return 0; //默认会出现括号，而如果有括号都得压进去
    }
}int main()
{int t;cin >> t;while(t--){stack<char>s;stack<double>d;string s1,s2;cin >> s1;int i=0;s2 = "";s.push('#');while(i < s1.length()-1){ // 等于号 不用扫描if('(' == s1[i]){s.push(s1[i++]);}else if(')' == s1[i]){while(s.top() != '('){s2 += s.top();s2 += ' '; //加空格是为了计算时的方便
                    s.pop();}s.pop();//把左括号弹出i++;}else if(s1[i] == '+'||s1[i] == '-'||s1[i] == '*'||s1[i] == '/'){while(prio(s.top()) >= prio(s1[i])){s2 += s.top();s2 += ' ';s.pop();}s.push(s1[i]);i++;}else{//如果是数字类while(s1[i] >= '0'&&s1[i] <= '9'||s1[i] == '.'){s2 += s1[i++];}s2 += ' ';}}while(s.top() != '#'){ //当表达式扫描完，栈中还有剩余符号s2 += s.top();s2 += ' ';s.pop();}//        cout << s2 << endl;double result = 0;i = 0;while(i < s2.length()){switch (s2[i]){case '+':result = d.top();d.pop();result += d.top();d.pop();i++;break;case '-':result = d.top();d.pop();result = d.top() - result;d.pop();i++;break;case '*':result = d.top();d.pop();result *= d.top();d.pop();i++;break;case '/':result = d.top();d.pop();result = d.top()/result;//注意因为是栈，所以除法的顺序发生变化
                    d.pop();i++;break;default:result = 0;double fac = 10.0;while(s2[i] >= '0'&&s2[i] <= '9'){result = result*10 + s2[i] - '0';i++;}if(s2[i++] == '.'){while(s2[i] >= '0'&&s2[i] <= '9'){result += (s2[i] - '0')/fac;fac *= 10;i++;}}}
//            cout << result << endl;
            d.push(result);while(s2[i] == ' '){i++;}}printf("%.2lf\n",d.top());}return 0;
}