/*#include <stdio.h>
int map[10][10]= {};
int map1[10][10]= {};
void find(int x, int y)
{
map1[x][y]=-1;
if (map1[x-1][y]==0&&x-1>0)
{
find (x-1,y);
}
if (map1[x+1][y]==0)
{
find (x+1,y);
}
if (map1[x][y-1]==0&&y-1>0)
{
find (x,y-1);
}
if (map1[x][y+1]==0)
{
find (x,y+1);
}
}
int main()
{
int i,j,r,c,k;
for (i=1; i<=9; i++)
{
for (j=1; j<=9; j++)
{
scanf ("%d",&map[i][j]);
}
}
scanf("%d %d",&r,&c);
if (map[r][c]==1)
{
printf ("-1");
return 0;
}
for (i=1; i<=9; i++)
{
for (j=1; j<=9; j++)
{
k=map[i+1][j]+map[i][j]+map[i-1][j]+map[i][j-1]+map[i][j+1]+map[i-1][j-1]+map[i-1][j+1]+map[i+1][j-1]+map[i+1][j+1];
map1[i][j]=k;
}
}
for (i=1; i<=9; i++)
{
for (j=1; j<=9; j++)
{
printf ("%d ",map1[i][j]);
}
printf("\n");
}
if(map1[r][c]==0)
find(r,c);
for (i=1; i<=9; i++)
{
for (j=1; j<=9; j++)
{
printf ("%d ",map1[i][j]);
}
printf("\n");
}
return 0;
}
*/
#include <stdio.h>
int map[20][20]= {};
int visited [400]= {};
int cnt=0;
int call=0;
void find(int x, int y)
{
if (map[x-1][y] && x-1>=0)
{
find (x-1,y);
}
if (map[x+1][y])
{
find (x+1,y);
}
if (map[x][y-1] && y-1>=0)
{
find (x,y-1);
}
if (map[x][y+1])
{
find (x,y+1);
}
}
int main ()
{
int n,i,j,black,white,draw;
scanf ("%d",&n);
for (i=1; i<=19; i++)
{
for (j=1; j<=19; j++)
{
scanf ("%d",&map[i][j]);
}
}
black=1;
white=2;
draw=0;
for (i=1; i<=19; i++)
{
if (black<white && white==5)
{
printf ("%d\n %d ",white,map[i][j]);
}
else if (black>white && black==5)
{
printf ("%d\n %d ",black,map[i][j]);
}
else
{
printf ("%d\n %d ",draw,map[i][j]);
}
}
/*
for (i=1; i<=19; i++)
{
for (j=1; j<=19; j++)
{
if (map[i][j]==0)
{
cnt++;
find (i,j);
call++;
}
}
}
*/
return 0;
}