#include<bits/stdc++.h>
#define N 10005
using namespace std;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int n;
int a[N][N],b[N][N];
struct Node{
	int x,y,z;
};
queue<Node> q;
void bfs(){
	while(!q.empty()){
		Node cnt=q.front();
		q.pop();
		for(int i=0;i<4;i++){
			int nx=cnt.x+dx[i];
			int ny=cnt.y+dy[i];
			if(nx>=0&&nx<=n&&ny>=0&&ny<=n&&a[nx][ny]==0){
				a[nx][ny]=2;
				q.push((Node){nx,ny,a[nx][ny]});
			}
		}
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++){ 
			cin>>b[i][j];
			if(b[i][j]==1) a[i][j]=1;
		}
	q.push((Node){0,0,0});
	bfs();
	for(int i=1;i<=n;i++,cout<<endl){
		for(int j=1;j<=n;j++){
			if(a[i][j]==1) cout<<1<<" ";
			else if(a[i][j]==2) cout<<0<<" ";
			else cout<<2<<" ";
		}
	}
	return 0;
}