#include<cstdio>

 #include<cstring>

 #include<queue>

 #include<algorithm>

 using namespace std;

 #define MAXN 222

 #define MAXM 222*222*2

 #define INF (1<<30)

 struct Edge{

     int v,cap,flow,next;

 }edge[MAXM];

 int vs,vt,NE,NV;

 int head[MAXN];

 void addEdge(int u,int v,int cap){

     edge[NE].v=v; edge[NE].cap=cap; edge[NE].flow=;

     edge[NE].next=head[u]; head[u]=NE++;

     edge[NE].v=u; edge[NE].cap=; edge[NE].flow=;

     edge[NE].next=head[v]; head[v]=NE++;

 }

 int level[MAXN];

 int gap[MAXN];

 void bfs(){

     memset(level,-,sizeof(level));

     memset(gap,,sizeof(gap));

     level[vt]=;

     gap[level[vt]]++;

     queue<int> que;

     que.push(vt);

     while(!que.empty()){

         int u=que.front(); que.pop();

         for(int i=head[u]; i!=-; i=edge[i].next){

             int v=edge[i].v;

             if(level[v]!=-) continue;

             level[v]=level[u]+;

             gap[level[v]]++;

             que.push(v);

         }

     }

 }

 int pre[MAXN];

 int cur[MAXN];

 int ISAP(){

     bfs();

     memset(pre,-,sizeof(pre));

     memcpy(cur,head,sizeof(head));

     int u=pre[vs]=vs,flow=,aug=INF;

     gap[]=NV;

     while(level[vs]<NV){

         bool flag=false;

         for(int &i=cur[u]; i!=-; i=edge[i].next){

             int v=edge[i].v;

             if(edge[i].cap!=edge[i].flow && level[u]==level[v]+){

                 flag=true;

                 pre[v]=u;

                 u=v;

                 //aug=(aug==-1?edge[i].cap:min(aug,edge[i].cap));

                 aug=min(aug,edge[i].cap-edge[i].flow);

                 if(v==vt){

                     flow+=aug;

                     for(u=pre[v]; v!=vs; v=u,u=pre[u]){

                         edge[cur[u]].flow+=aug;

                         edge[cur[u]^].flow-=aug;

                     }

                     //aug=-1;

                     aug=INF;

                 }

                 break;

             }

         }

         if(flag) continue;

         int minlevel=NV;

         for(int i=head[u]; i!=-; i=edge[i].next){

             int v=edge[i].v;

             if(edge[i].cap!=edge[i].flow && level[v]<minlevel){

                 minlevel=level[v];

                 cur[u]=i;

             }

         }

         if(--gap[level[u]]==) break;

         level[u]=minlevel+;

         gap[level[u]]++;

         u=pre[u];

     }

     return flow;

 }

 inline int in(int &ret){

     char c; ret=;

     while(c=getchar(),c<''||c>'') if(c=='\n'||c==EOF) return -;

     while(c>=''&&c<='') ret=ret*+c-'',c=getchar();

     if(c=='\n'||c==EOF) return ;

     return ;

 }

 int win[],n;

 bool isStatue(int s){

     for(int i=;i<n;++i){

         if((s>>i)&) continue;

         if(win[s]==win[n-]) return ;

     }

     return ;

 }

 int getCnt(int s){

     int cnt=;

     for(int i=;i<n;++i){

         if((s>>i)&) ++cnt;

     }

     return cnt;

 }

 int main(){

     int t;

     scanf("%d ",&t);

     while(t--){

         n=;

         int tmp;

         while(tmp=in(win[n]),tmp==) ++n;

         if(tmp==) ++n;

         int tot=;

         for(int i=; i<n; ++i) tot+=win[i];

         int res=;

         for(int s=; s<(<<n); ++s){

             if(!isStatue(s)) continue;

             memset(head,-,sizeof(head));

             vs=; vt=; NV=; NE=;

             for(int i=; i<n; ++i){

                 addEdge(i+n*n,vt,win[i]);

             }

             for(int i=; i<n; ++i){

                 for(int j=i+; j<n; ++j){

                     addEdge(vs,i*n+j,);

                     if(((s>>i)&) && win[i]<win[j]) addEdge(i*n+j,i+n*n,);

                     else if(((s>>j)&) && win[j]<win[i]) addEdge(i*n+j,j+n*n,);

                     else{

                         addEdge(i*n+j,i+n*n,);

                         addEdge(i*n+j,j+n*n,);

                     }

                 }

             }

             if(ISAP()==tot) res=max(res,getCnt(s));

         }

         printf("%d\n",res);

     }

     return ;

 }