#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<string> a;

int consistency(int n){
	
	vector<int> dpMax(n+1, -LINF);
	vector<int> dpMin(n+1, LINF);
	
	dpMax[0] = 1;
	dpMin[0] = 1;
	
	for(int i=1; i<=n; i++){
		string opn = a[i-1];
		
		char op = opn[0];
		if(op == 'N'){
			dpMax[i] = max(dpMax[i-1] , -dpMin[i-1] );
			dpMin[i] = min(dpMin[i-1] , -dpMax[i-1] );
		}
		else{
			int x = stoll(opn.substr(2));
			
			if(op == '+'){
				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] + x);
				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] + x);
			}
			else if(op == '-'){
				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] - x);
				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] - x);
			}
			else if(op == '/'){
				dpMax[i] = max(dpMax[i-1] , dpMax[i-1]/x );
				dpMin[i] = min(dpMin[i-1] , dpMin[i-1]/x );
			}
			else { 
				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] * x);
				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] * x);
			}
		}
	}
	
	return dpMax[n];

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    cin.ignore();
    
    a.resize(n);
    for(int i=0; i<n; i++){
    	string line;
    	getline(cin, line);
    	a[i] = line;
    }
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    cin.ignore();
    while (t--) {
        solve();
    }

    return 0;
}