#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<cmath>#include<map>#include<queue>#include<stack>#define INF 0x3f3f3f3f#define ull unsigned lonb long#define ll long long#define IN __int64#define N 1010#define M 1000000007using namespace std;stack<char>ss;char s[N];int main(){int t,i,j;scanf("%d",&t);while(t--){scanf("%s",s);int len=strlen(s);int l=0,r=0;for(i=0;i<len;i++){if(s[i]=='('){l++;ss.push(s[i]);}else{if(l){r++;l--;ss.pop();}}}printf("%d\n",r);}return 0;}
