/*
int main()
{
printf("Hello world!\n");
return 0;
}
ㅇㄴ*/
#include <stdio.h>
int arr[101][101]={};
int x,y,a=1;
int queue[2][101]={};
int front=-1;
int back=-1;
void bfs(int x,int y)
{
push(x,y);
arr[x][y]=0;
while(front != back)
{
pop();
if(arr[px][py+1]==1)
}
}
void push(int x,int y)
{
back++;
queue[0][back] = x;
queue[1][back] = y;
}
void pop()
{
if(front == back)
{
return ;
}
front++;
px = queue[0][front];
py = queue[1][front];
}
int main()
{
scanf("%d",&n);
scanf("%d %d",&x,&y);
arr[x][y]=a;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
}
}
}
#include <stdio.h>
int arr[1001][1001]={};
int queue[2][501]={};
int back = -1;
int front = -1;
int n,x,y,m=0,px,py,a=1,x1,x2;
void push( int x, int y ){
back++;
queue[0][back] = x;
queue[1][back] = y;
arr[x][y] = a++;
}
void bfs(int x, int y){
push(x,y);
while(front != back){
pop();
if(py-1>=1 && arr[px][py-1] == ' ' && arr[px][py]!=1) push(px,py-1);
if(py+1<=2*n-1 && arr[px][py+1] == ' ' && arr[px][py]!=1) push(px,py+1);
if(px-1>=1 && arr[px-1][py] == ' ' && arr[px][py]!=1) push(px-1,py);
if(px+1<=2*n-1 && arr[px+1][py] == ' ' && arr[px][py]!=1) push(px+1,py);
}
}
void pop( ){
if(front == back) return ;
front ++;
px = queue[0] [front];
py = queue[1][front];
}
int main(){
scanf("%d",&n);
scanf("%d %d",&x1,&x2);
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(arr[i][j]==arr[x1][x2]) arr[i][j]=1;
else arr[i][j] = ' ';
}
}
return 0;
}