#define USE_CPP11
// #define USE_PRINTF

#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <complex>
#include <memory>
#include <sstream>

#ifdef USE_CPP11
#include <unordered_map>
#include <unordered_set>
#include <functional>
#endif

#define PRINT(obj) cout << obj << endl
#define REP(i, n) for(int (i) = 0; (i) < (n); i++)
#define SPACE " "

typedef long long ll;

const int INF = 1e9 + 10;

using namespace std;

namespace Scanner {
#ifdef USE_PRINTF
  int    nextInt()    { int    d; scanf("%d" , &d); return d; }
  float  nextFloat()  { float  f; scanf("%f" , &f); return f; }
  double nextDouble() { double f; scanf("%lf", &f); return f; }  
  string nextString() { string s; scanf("%s" , &s); return s; }
  ll     nextll()     { ll     l; scanf("%ll", &l); return l; }
#else
  int    nextInt()    { int    d; cin >> d; return d; }
  float  nextFloat()  { float  f; cin >> f; return f; }
  double nextDouble() { double f; cin >> f; return f; }  
  string nextString() { string s; cin >> s; return s; }
  ll     nextll()     { ll     l; cin >> l; return l; }
#endif

  string getLine() { 
    string input;
    getline(cin, input);
    return input;
  }
};

namespace myLibrary {
  vector<string> split(const string& str, char delim) {
    vector<string> ret;
    size_t current = 0, found;
    while ((found = str.find_first_of(delim, current)) != string::npos) {
      ret.push_back(string(str, current, found - current));
      current = found + 1;
    }
    ret.push_back(string(str, current, str.size() - current));
    return ret;
  }
  
#ifdef USE_CPP11
  ///
  /// higher-order functional
  /// This is something like map in haskell, python, etc.
  /// Sample usage:
  ///   vector<int> a = {1, 2, 3, 4, 5};
  ///   vector<int> b = myLibrary::_Map<int, int>(a, [](int n){
  ///     return n * n;
  ///   });
  /// Result:
  ///   b = 1, 4, 9, 16, 25
  ///
  template<typename T_IN, typename T_OUT, class Functor>
  vector<T_OUT> _Map(vector<T_IN> src, Functor func) {
    vector<T_OUT> ret;
    for (int i = 0; i < src.size(); i++) {
      ret.push_back(func(src[i]));
    }
    return ret;
  }
#endif

};

/// BEGIN //////////////////////////////////////////////////////////

struct Tree {
public:
  int value;
  Tree* parent;
  vector<Tree*> child;
  Tree(): parent(nullptr), value(-INF) { }
};

void maketree(Tree* tree, int index, const string str) {
  if (index >= str.size()) {
    return;
  }
  if (str[index] == '[') {
    Tree* newNode = new Tree();
    newNode->parent = tree;
    tree->child.push_back(newNode);
    maketree(newNode, index + 1, str);
  } else if (str[index] >= '0' && str[index] <= '9') {
    if (tree->value == -INF) {
      tree->value = 0;
    }
    tree->value = tree->value * 10 + (str[index] - '0');
    maketree(tree, index + 1, str);
  } else if (str[index] == ']') {
    maketree(tree->parent, index + 1, str);
  }
}

void getValue(Tree* tree) {
  if (tree->value > -INF) {
    return;
  }
  int size = tree->child.size();
  vector<int> vals(size);
  REP(i, size) {
    getValue(tree->child[i]);
    vals[i] = tree->child[i]->value;
  }
  sort(vals.begin(), vals.end());
  int val = 0;
  REP(i, (size / 2) + 1) {
    if (tree->child[i]->child.size() == 0) {
      vals[i] = (vals[i] / 2) + 1;  
    }
    val += vals[i];
  }
  tree->value = val;
}

int main() {
  int n = Scanner::nextInt();
   
  REP(i, n) {
    Tree tree;   
    string input = Scanner::nextString();
    maketree(&tree, 0, input);
    getValue(&tree);
    PRINT(tree.value);  
  }
  return 0;
}

/// END   //////////////////////////////////////////////////////////

Measured memory_bytes: 6028