#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#define maxn 50 

using namespace std;

int n,a[maxn][maxn];
int b[5][2]={{-1,0},{1,0},{0,-1},{0,1}};
queue<int> q;

int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
			if(a[i][j]==0)a[i][j]=2;
		}
	for(int i=0;i<=n+1;i++)
		a[0][i]=2,a[n][i]=2,a[i][0]=2,a[i][n]=2;
	q.push(a[0][0]);
	while(!q.empty()){
		for(int i=0;i<=3;i++){
			int x=b[i][0],y=b[i][1];
			q.pop();
			if(x>n+1||y>1+n||x<0||y<0
			||a[x][y]==1||a[x][y]==0)continue;
			a[x][y]=0;q.push(a[x][y]);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)
			cout<<a[i][j]<<' ';
		cout<<endl;
	}
	return 0;
}