#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 typedef unsigned long long ull;

 const int inf=0x3f3f3f3f;

 struct node

 {

     int val[][];

     int tp;

     int r;

     int c;

     int step;

 }s,t;

 ull Hash(node t)

 {

     ull tmp=;

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

     {

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

         {

             tmp=tmp*+t.val[i][j];

         }

     }

     return tmp;

 }

 queue<node> Q;

 map<ull,int> book[];

 int dir[][]={{,},{-,},{,},{-,-}};

 int bfs(node s,node t)

 {

     while(!Q.empty()) Q.pop();

     book[].clear();

     book[].clear();

     s.step=t.step=;

     s.tp=;t.tp=;

     book[s.tp][Hash(s)]=;

     book[t.tp][Hash(t)]=;

     Q.push(s);Q.push(t);

     while(!Q.empty())

     {

         node q=Q.front(),e;Q.pop();

         ull tmp=Hash(q);

         if(book[!q.tp].count(tmp))

         {

             if(book[!q.tp][tmp]+q.step<=)

                 return book[!q.tp][tmp]+q.step;

             else continue;

         }

         if(q.step>=) continue;

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

         {

             e=q;

             e.r+=dir[i][];

             e.c+=dir[i][];

             if(e.r<||e.r>=||e.c<||e.c>=||e.c>e.r) continue;

             swap(e.val[e.r][e.c],e.val[q.r][q.c]);

             ull tmp=Hash(e);

             if(book[e.tp].count(tmp)) continue;

             book[e.tp][tmp]=++e.step;

             Q.push(e);

         }

     }

     return inf;

 }

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

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

         {

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

             {

                 scanf("%d",&s.val[i][j]);

                 if(s.val[i][j]==)

                 {

                     s.r=i;s.c=j;

                 }

                 t.val[i][j]=i;

             }

         }

         t.r=t.c=;

         int ans=bfs(s,t);

         if(ans==inf) puts("too difficult");

         else printf("%d\n",ans);

     }

     return ;

  }