/**
#include<stdio.h>
int map[101][101] = {}, copy[101][101] = {}, n;
void dfs(int i, int j, int num)
{
if (i < 1 || i > n || j < 1 ||j > n || copy[i][j] <= num)
{
return ;
}
copy[i][j] = -1;
dfs(i - 1, j, num);
dfs(i, j + 1, num);
dfs(i + 1, j, num);
dfs(i, j - 1, num);
}
int main()
{
int i,j,k, max = 0, q, cnt = 0, cntmax = 0;
scanf("%d", &n);
for (i = 1 ; i <= n ; i ++)
{
for (j = 1 ; j <= n ; j ++)
{
scanf("%d", &map[i][j]);
if (map[i][j] > max)
{
max = map[i][j];
}
copy[i][j] = map[i][j];
}
}
for (q = 0 ; q <= max ; q ++)
{
cnt = 0;
for (i = 0 ; i <= n ; i ++)
{
for (j = 0 ; j <= n ; j ++)
{
if (q < copy[i][j])
{
cnt ++;
dfs(i, j, q);
if (cntmax < cnt)
{
cntmax = cnt;
}
}
}
}
for (i = 1 ; i <= n ; i ++)
{
for (j = 1 ; j <= n ; j ++)
{
copy[i][j] = map[i][j];
}
}
}
printf("%d", cntmax);
return 0;
}
#include<stdio.h>
int x, y;
char image[11][11]={};
void dfs(int x1, int y1)
{
if (x1 < 0 || x1 >= 10 || y1 < 0 || y1 >= 10 || image[x1][y1] == '*')
{
return ;
}
image[x1][y1] = '*';
dfs(x1, y1 - 1);
dfs(x1 + 1, y1);
dfs(x1, y1 + 1);
dfs(x1 - 1, y1);
}
int main()
{
int i,j,k;
for (i = 0 ; i < 10 ; i ++)
{
scanf("%s", image[i]);
}
scanf("%d %d", &x, &y);
dfs(y, x);
for (i = 0 ; i < 10 ; i ++)
{
for (j = 0 ; j < 10 ; j ++)
{
printf("%c", image[i][j]);
}
printf("\n");
}
return 0;
}
**/