#include <bits/stdc++.h>
using namespace std;
int n;
int mp[105][105];
void dfs(int x,int y){
int dx[4]={1,0,0,-1};//四方向数组
int dy[4]={0,1,-1,0};
mp[x][y]=-1;
for(int i=0;i<4;i++){
int nx=dx[i]+x;
int ny=dy[i]+y;
if(nx>n+1||nx<0||ny>n+1||ny<0){
continue;
}else if(mp[nx][ny]1||mp[nx][ny]-1){
continue;
}
dfs(nx,ny);
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>mp[i][j];
}
}
dfs(0,0);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(mp[i][j]==-1){
cout<<0<<" ";
}else if(mp[i][j]==0){
cout<<2<<" ";
}else{
cout<<1<<" ";
}
}
cout<<"\n";
}
return 0;
}
