/*
#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
*/
/*
#include<stdio.h>
int i,j;
struct loc
{
int x,y;
};
char map[15][15] = {0};
char map1[15][15] = {0};
struct loc location[100000] = {0};
int front,rear;
void f1()
{
int x = location[front].x;
int y = location[front].y;
front++;
if(x==0 || y==0 || x==10 || y==10)
return;
int sum = 0;
if(map[x][y]=='1')
return ;
for(i=-1; i<=1; i++)
{
for(j=-1; j<=1; j++)
{
if(map[x+i][y+j]=='1')
{
sum++;
}
}
}
if(sum>0)
{
map1[x][y] = sum+'0';
return ;
}
}
int main()
{
int k,n,i,j;
int x,y;
int front = rear = 0;
int map[15][15] = {0},map1[15][15] = {0};
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
scanf ("%d",&map[i][j]);
map1[i][j] = '_';
}
}
scanf ("%d %d",&x,&y);
if(map[x][y]=='1')
{
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
if(x==i&&y==j)
{
printf ("-1");
}
else
{
printf ("_ ");
}
}
printf ("\n");
}
return 0;
}
else
{
location[rear].x = x;
location[rear].y = y;
for(;front!=rear;)
{
f1();
}
}
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
if(map[i][j]==-1)
{
printf("-1 ");
}
else
{
printf ("%c ", map1[i][j]);
}
}
printf ("\n");
}
}
*/
/*
#include<stdio.h>
int map[100][100] = {0};
int queue[100000][2] = {0};
int front = 0, rear = 0;
void v()
{
int k = front;
int x, y, p;
int i;
for(i=rear; i<k; i++)
{
x = queue[i][0];
y = queue[i][1];
p = map[x][y];
if(map[x-1][y]==0)
{
map[x-1][y] = p+1;
queue[front][0] = x-1;
queue[front][1] = y;
front++;
}
if(map[x+1][y]==0)
{
map[x+1][y] = p+1;
queue[front][0] = x+1;
queue[front][1] = y;
front++;
}
if(map[x][y-1]==0)
{
map[x][y-1] = p+1;
queue[front][0] = x;
queue[front][1] = y-1;
front++;
}
if(map[x][y+1]==0)
{
map[x][y+1] = p+1;
queue[front][0] = x;
queue[front][1] = y+1;
front++;
}
rear++;
}
}
int main()
{
int x, y, i, j, n, k=0;
scanf("%d", &n);
for(i=0; i<=n+1; i++)
{
for(j=0; j<=n+1; j++)
{
if(i==0 || j==0 || i==n+1 || j==n+1)
{
map[i][j] = 9;
}
}
}
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
scanf("%d", &map[i][j]);
if(map[i][j] > 0)
{
queue[front][0] = i;
queue[front][1] = j;
front++;
}
}
}
while(front != rear)
{
v();
}
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
printf("%d ", map[i][j]);
}
printf("\n");
}
}
*/