/**
#include<stdio.h>
int map[21][21] = {}, x, y;
int dir[4][2]={{0,+1},{+1,+1},{1,0},{-1,+1}};
int isend = 0;
void dfs(int i, int j, int data, int direction, int sum)
{
if (i < 1 || i > 19 || j < 1 || j > 19 || map[i][j] != data)
{
return ;
}
sum++;
//printf("i = %d j = %d sum = %d\n",i,j,sum);
if (sum == 5)
{
//printf("x = %d y = %d\n",x,y);
if (map[i + dir[direction][0]][j + dir[direction][1]] != data &&
map[x - dir[direction][0]][y - dir[direction][1]] != data)
{
printf("%d\n", map[i][j]);
isend = 1;
}
return ;
}
dfs(i+dir[direction][0],j+dir[direction][1], data, direction,sum);
}
int main()
{
int i, j, k, n, m;
for (i = 1 ; i <= 19 ; i ++)
{
for (j = 1 ; j <= 19 ; j ++)
{
scanf("%d", &map[i][j]);
}
}
for (i = 1 ; i <= 19 ; i ++)
{
for (j = 1 ; j <= 19 ; j ++)
{
if (map[i][j] != 0)
{
// printf("i = %d j = %d dfs start!\n",i,j);
for(k = 0 ; k < 4 ; k ++)
{
x = i;
y = j;
dfs(i, j, map[i][j], k, 0);
if(isend == 1)
{
printf("%d %d", x, y);
return 0;
}
}
}
}
}
if(isend==0) printf("0");
return 0;
}
**/
#include<stdio.h>
int main()
{
}