// ACM-ICPC‘“ΰ—\‘I2013 C. ŠK‘w–―ŽεŽε‹`

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

int solve(const string& str, int& idx){
	int res = 0;
	++idx;
	if(str[idx] != '['){
		while(isdigit(str[idx])){
			res = 10*res + str[idx]-'0';
			++idx;
		}
		res = res/2+1;
	} else {
		vector<int> vi;
		while(str[idx] == '[')
			vi.push_back(solve(str, idx));
		sort(vi.begin(), vi.end());
		for(int i=0;i<vi.size()/2+1;i++)
			res += vi[i];
	}
	++idx;
	return res;
}

int main(){
	int n; cin >> n;
	while(n--){
		string str; cin >> str;
		int idx = 0;
		cout << solve(str, idx) << endl;
	}
}