/*
#include <stdio.h>
int a[11][11]={}; //원래 지뢰상태
int d[10][10]={}; //지뢰찾기 후 출력할 상태
void dfs(int x, int y)
{
if(x<1||x>9||y<1||y>9||d[x][y]!=-2) return;
int sum = a[x][y+1] + a[x+1][y] + a[x][y-1] + a[x-1][y] + a[x+1][y+1] + a[x+1][y-1] + a[x-1][y+1] + a[x-1][y-1];
d[x][y] = sum;
if(sum!=0) return;
dfs(x, y+1);
dfs(x+1, y);
dfs(x, y-1);
dfs(x-1, y);
dfs(x+1, y+1);
dfs(x+1, y-1);
dfs(x-1, y+1);
dfs(x-1, y-1);
}
int main()
{
int x, y;
for(int i=1; i<=9; i++)
{
for(int j=1; j<=9; j++)
{
scanf("%d", &a[i][j]);
d[i][j]=-2;
}
}
scanf("%d %d", &x, &y);
if(a[x][y]==1) d[x][y]=-1;
dfs(x,y);
for(int i=1; i<=9; i++)
{
for(int j=1; j<=9; j++)
{
if(d[i][j]!=-2) printf("%d ", d[i][j]);
else printf("_ ");
}
printf("\n");
}
}
bool true false
*/
#include <stdio.h>
#include <stdbool.h>
int count=0;
int a[21][21]={};
bool flag = false; // 승부가 났는지?
void dfs(int x, int y, int color, int direction)
{
if(count>5||x<1||x>19||y<1||y>19||a[x][y]==0) return;
//f(a[x][y]!=color) return;
if(direction==1) //양옆
{
count++;
if(count==5)
{
if(a[x][y+1]!=color) flag=true;
return;
}
dfs(x, y+1, color, 1);
}
if(direction==2) //위아래
{
count++;
if(count==5)
{
if(a[x+1][y]!=color) flag=true;
return;
}
dfs(x+1, y, color, 2);
}
if(direction==3) //왼쪽 대각선
{
count++;
if(count==5)
{
if(a[x+1][y+1]!=color) flag=true;
return;
}
dfs(x+1, y+1, color, 3);
}
if(direction==4) //오른쪽 대각선
{
count++;
if(count==5)
{
if(a[x+1][y-1]!=color) flag=true;
return;
}
dfs(x-1, y+1, color, 4);
}
}
int main()
{
for(int i=1; i<=19; i++)
{
for(int j=1; j<=19; j++)
scanf("%d", &a[i][j]);
}
for(int i=1; i<=19; i++)
{
for(int j=1; j<=19; j++)
{
count=0;
if(a[i][j+1]==a[i][j] && a[i][j-1]!=a[i][j]) dfs(i, j, a[i][j], 1);
if(count==5 && flag==true) { printf("%d\n%d %d", a[i][j], i, j); return 0;}
if(a[i+1][j]==a[i][j] && a[i-1][j]!=a[i][j]) dfs(i, j, a[i][j], 2);
if(count==5 && flag==true) { printf("%d\n%d %d", a[i][j], i, j); return 0;}
if(a[i+1][j+1]==a[i][j] && a[i-1][j-1]!=a[i][j]) dfs(i, j, a[i][j], 3);
if(count==5 && flag==true) { printf("%d\n%d %d", a[i][j], i, j); return 0;}
if(a[i-1][j+1]==a[i][j] && a[i+1][j-1]!=a[i][j]) dfs(i, j, a[i][j], 4);
if(count==5 && flag==true) { printf("%d\n%d %d", a[i][j], i, j); return 0;}
//printf("%d %d", i, j);
}
}
}