#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
typedef long long LL;
const int MAXN=105;
int s[15],id[105][105],v[105][105],cnt1,cnt2;
char str[25];
struct dinic
{
    struct Edge
    {
        int from,to,cap,flow;
        Edge(){}
        Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){};
    };
    int s,t,d[MAXN],cur[MAXN];
    bool vis[MAXN];
    vector<Edge>edges;
    vector<int>G[MAXN];
    inline void init()
    {
        for(int i=0;i<100;i++)G[i].clear();
        edges.clear();
    }
    void addedge(int from,int to,int cap)
    {
        edges.push_back((Edge){from,to,cap,0});
        edges.push_back((Edge){to,from,0,0});
        int m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    bool bfs()
    {
        memset(vis,0,sizeof(vis));
        queue<int>q;
        q.push(s);
        d[s]=0;
        vis[s]=1;
        while(!q.empty())
        {
            int x=q.front();q.pop();
            for(int i=0;i<G[x].size();i++)
            {
                Edge& e=edges[G[x][i]];
                if(!vis[e.to]&&e.cap>e.flow)
                {
                    vis[e.to]=1;
                    d[e.to]=d[x]+1;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int dfs(int x,int a)
    {
        if(x==t||a==0)return a;
        int flow=0,f;
        for(int& i=cur[x];i<G[x].size();i++)
        {
            Edge& e=edges[G[x][i]];
            if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
            {
                e.flow+=f;
                edges[G[x][i]^1].flow-=f;
                flow+=f;
                a-=f;
                if(a==0)break;
            }
        }
        return flow;
    }
    int maxflow(int s,int t)
    {
        this->s=s,this->t=t;
        int flow=0;
        while(bfs())
        {
            memset(cur,0,sizeof(cur));
            flow+=dfs(s,2e5+5);
        }
        return flow;
    }
}dc;
bool check(int x)
{
    dc.init();
    memset(v,0,sizeof(v));
    for(int i=1;i<=cnt1;i++)
        dc.addedge(0,i,s[i]);
    for(int i=1;i<=x;i++)
        for(int j=i+1;j<=x;j++)
            if(s[i]>s[j])
                dc.addedge(j,id[i][j],1),v[i][j]=1;
    for(int i=1;i<=cnt1;i++)
        for(int j=i+1;j<=cnt1;j++)
        {
            dc.addedge(id[i][j],cnt1+cnt2+1,1);
            if(!v[i][j])
                dc.addedge(i,id[i][j],1),dc.addedge(j,id[i][j],1);
        }
    return dc.maxflow(0,cnt1+cnt2+1)==cnt1*(cnt1-1)/2;
}
int main()
{
    int T;
    scanf("%d",&T);
    getchar();
    while(T--)
    {
        gets(str);
        cnt1=cnt2=0;
        for(int i=0,len=strlen(str);i<len;i++)
            if(str[i]!=‘ ‘)
                s[++cnt1]=(int)str[i]-‘0‘;
        for(int i=1;i<=cnt1/2;i++)
            swap(s[i],s[cnt1-i+1]);
        for(int i=1;i<=cnt1;i++)
            for(int j=i+1;j<=cnt1;j++)
                id[i][j]=++cnt2+cnt1;
        for(int i=cnt1;i>=1;i--)
            if(check(i))
            {
                printf("%d\n",i);
                break;
            }
    }
    return 0;
}