#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N =1003;
char s[N];
int cnt1[N], cnt2[N];

void solve()
{
    scanf("%s", s);
    int n=(int)strlen(s);
    int t=0;
    for (int i=0; i<n; ++i) {
        if (s[i] == '(') {
            ++t;
        }
        cnt1[i] = t;
    }
    t = 0;
    for (int i=n-1; i>=0; --i) {
        if (s[i] == ')') {
            ++t;
        }
        cnt2[i] = t;
    }
    int ans=min(cnt2[0],cnt1[n-1]);
    for (int i=1; i<n; ++i) {
        ans = min(cnt1[i-1]+cnt2[i], ans);
    }
    printf("%d\n", ans);
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}