#include<stdio.h>     //A
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<stdlib.h>
using namespace std;
#define ll long long
#define N 200
int a[800][10];
int main()
{int i,T,i1,i2,i3,i4,i5,i6;int m,n,cnt,flag;scanf("%d",&T);while(T--){cnt=0;flag=0;for(i=1;i<=6;i++)scanf("%d",&a[0][i]);for(i1=1;i1<=6;i1++){for(i2=1;i2<=6;i2++){if(i2==i1)continue;for(i3=1;i3<=6;i3++){if(i3==i1||i3==i2)continue;for(i4=1;i4<=6;i4++){if(i4==i1||i4==i2||i4==i3)continue;for(i5=1;i5<=6;i5++){if(i5==i1||i5==i2||i5==i3||i5==i4)continue;for(i6=1;i6<=6;i6++){if(i6==i1||i6==i2||i6==i3||i6==i4||i6==i5)continue;else{++cnt;a[cnt][1]=a[0][i1];a[cnt][2]=a[0][i2];a[cnt][3]=a[0][i3];a[cnt][4]=a[0][i4];a[cnt][5]=a[0][i5];a[cnt][6]=a[0][i6];}}}}}}}for(i=1;i<=cnt;i++){if(a[i][1]+a[i][2]+a[i][3]==a[i][4]+a[i][5]+a[i][6]){flag=1;break;}}if(flag)printf("YES\n");elseprintf("NO\n");}return 0;
}

#include<stdio.h>   //A题
#define N 10
int main()
{int n,a[N],i;scanf("%d",&n);while(n--){for(i=1;i<=6;i++)scanf("%d",&a[i]);if(a[1]+a[2]+a[3]==a[4]+a[5]+a[6]||a[1]+a[2]+a[4]==a[3]+a[5]+a[6]||a[1]+a[2]+a[5]==a[4]+a[3]+a[6]||a[1]+a[2]+a[6]==a[4]+a[5]+a[3]||a[1]+a[4]+a[3]==a[2]+a[5]+a[6]||a[1]+a[5]+a[3]==a[4]+a[2]+a[6]||a[1]+a[6]+a[3]==a[4]+a[5]+a[2]||a[1]+a[4]+a[5]==a[6]+a[2]+a[3]||a[1]+a[4]+a[6]==a[5]+a[2]+a[3]||a[1]+a[5]+a[6]==a[4]+a[2]+a[3])printf("YES\n");elseprintf("NO\n");}return  0;
}

#include<stdio.h>
#include<iostream>    //问题 E: QAQ
#include<algorithm>
#include<string.h>
#include<math.h>
#include<stdlib.h>
using namespace std;
#define ll long long
#define N 200
char a[108];int main()
{int T,i,j,k,len,cnt;scanf("%d",&T);while(T--){cnt=0;scanf("%s",a);len=strlen(a);for(i=0; i<len; i++){for(j=i+1; j<len; j++){for(k=j+1; k<len; k++){if(a[i]=='Q'&&a[j]=='A'&&a[k]=='Q'){cnt++;}}}}printf("%d\n",cnt);}return 0;
}

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INT 0x7fffffff
#define INF 0x3f3f3f3fint main()
{int t, n, m, a[25], b[15];scanf("%d", &t);while(t--){scanf("%d%d", &n, &m);for(int i=0; i<n; i++)scanf("%d", &a[i]);for(int i=0; i<m; i++)scanf("%d", &b[i]);sort(a,a+n);sort(b, b+m);int s=999;for(int i=0; i<n; i++){for(int j=0; j<m; j++){if(a[i]==b[j])s=min(min(a[i], b[j]), s);}}if(s!=-1&&s!=999)printf("%d\n", s);else if(a[0]<b[0])printf("%d\n", a[0]*10+b[0]);elseprintf("%d\n", b[0]*10+a[0]);}return 0;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<stdlib.h>
using namespace std;
#define ll long long
#define N 200
int a[15],b[15];int main()
{int T,n,m,i,j,minn1,minn2,ans;scanf("%d",&T);while(T--){minn1=minn2=100;scanf("%d%d",&n,&m);for(i=1;i<=n;i++){scanf("%d",&a[i]);minn1=min(minn1,a[i]); //表示A数组的最小值
        }for(i=1;i<=m;i++){scanf("%d",&b[i]);minn2=min(minn2,b[i]);  //表示B数组的最小值
        }if(minn1==minn2)ans=minn1;elseans=min(minn1*10+minn2,minn1+minn2*10);for(i=1;i<=n;i++){for(j=1;j<=m;j++){if(a[i]==b[j]) //如果出现重复值就拿重复值跟ans比较
                {if(ans>a[i])ans=a[i];}}}printf("%d\n",ans);}return 0;
}

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INT 0x7fffffff
#define INF 0x3f3f3f3fchar ch[5000006];
int main()
{int t, n, m;scanf("%d", &t);while(t--){int s=0;scanf("%d", &n);scanf("%s", ch);for(int i=0; i<n; i++){if(ch[i]=='(')s++;else{if(s>0)s--;}}printf("%d\n", (s+1)/2);}return 0;
}