/*
 * @(#) msp97_a.c - Problem 'A' ("10x10 chequers") solution
 * of the MSU Personal Programming Contest in 1997.
 * (c) 1998 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1998-09-20 16:55:00 GMT+04:00
 */

/* Input data file: a.in */

#include <stdio.h> /* FILE, fopen(), fscanf(), printf() */

#define N 10

int a[N][N];

int main()
{
 int cnt;
 char c;
 int i,j,p,q,m,k;
 int bi,bj,bm;
 int i2,j2,p2,q2,p3,q3,p4,q4,m2,k2;
 int bi2,bj2;
 FILE *f=fopen("a.in","rt");
 fscanf(f,"%*[^0-9]%d",&cnt);
 while (cnt--)
 {
  for (i=0;i<N;i++)
   for (j=0;j<N;j++)
    fscanf(f,"%*[^01]%c",&c),a[i][j]=c!='0';
  for (bm=0,k=0;k<N*N;k++)
   if (!a[i=k/N][j=k%N])
   {
    m=4+(i<N/2? i : N-1-i)+(j<N/2? j : N-1-j);
    for (p=0;p<i && a[i-p-1][j];p++);
    if (p>1)
     m-=p*p;
    for (q=0;i+q<N-1 && a[i+q+1][j];q++);
    if (q>1)
     m-=q*q;
    if (p || q)
     m+=(p+q+1)*(p+q+1);
    for (p=0;p<j && a[i][j-p-1];p++);
    if (p>1)
     m-=p*p;
    for (q=0;j+q<N-1 && a[i][j+q+1];q++);
    if (q>1)
     m-=q*q;
    if (p || q)
     m+=(p+q+1)*(p+q+1);
    if (m>bm)
     bi=i,bj=j,bm=m;
   }
  printf("%d %d; ",bi+1,bj+1);
  for (bm=0,k=0;k<N*N-1;k++)
   if (!a[i=k/N][j=k%N])
   {
    m=4+(i<N/2? i : N-1-i)+(j<N/2? j : N-1-j);
    for (p=0;p<i && a[i-p-1][j];p++);
    if (p>1)
     m-=p*p;
    for (q=0;i+q<N-1 && a[i+q+1][j];q++);
    if (q>1)
     m-=q*q;
    for (p2=0;p2<j && a[i][j-p2-1];p2++);
    if (p2>1)
     m-=p2*p2;
    for (q2=0;j+q2<N-1 && a[i][j+q2+1];q2++);
    if (q2>1)
     m-=q2*q2;
    for (k2=k+1;k2<N*N;k2++)
     if (!a[i2=k2/N][j2=k2%N])
     {
      m2=m+4+(i2<N/2? i2 : N-1-i2)+(j2<N/2? j2 : N-1-j2);
      for (p3=0;p3<i2 && a[i2-p3-1][j2];p3++);
      if (p3>1)
       m2-=p3*p3;
      for (q3=0;i2+q3<N-1 && a[i2+q3+1][j2];q3++);
      if (q3>1)
       m2-=q3*q3;
      for (p4=0;p4<j2 && a[i2][j2-p4-1];p4++);
      if (p4>1)
       m2-=p4*p4;
      for (q4=0;j2+q4<N-1 && a[i2][j2+q4+1];q4++);
      if (q4>1)
       m2-=q4*q4;
      if (j2==j && i2-i-1==q)
       m2+=(p+q+q3+2)*(p+q+q3+2);
       else
       {
        if (p || q)
         m2+=(p+q+1)*(p+q+1);
        if (p3 || q3)
         m2+=(p3+q3+1)*(p3+q3+1);
       }
      if (i2==i && j2-j-1==q2)
       m2+=(p2+q2+q4+2)*(p2+q2+q4+2);
       else
       {
        if (p2 || q2)
         m2+=(p2+q2+1)*(p2+q2+1);
        if (p4 || q4)
         m2+=(p4+q4+1)*(p4+q4+1);
       }
      if (m2>bm)
       bi=i,bj=j,bi2=i2,bj2=j2,bm=m2;
     }
   }
  printf("%d %d, %d %d\n",bi+1,bj+1,bi2+1,bj2+1);
 }
 return 0;
}