#include<bits/stdc++.h>
using namespace std;
int a[31][31],b[31][31];
int n;
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
bool f=true;
void dfs(int x,int y){
	a[x][y]=1;
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=n&&a[tx][ty]==0){
			dfs(tx,ty);
		}
	}
}
int main(){
   cin>>n;
   for(int i=1;i<=n;i++){
   	for(int j=1;j<=n;j++){
   		cin>>a[i][j];
   		b[i][j]=a[i][j];
   	}
   }
   for(int i=1;i<=n;i++){
   	for(int j=1;j<=n;j++){
   		if((i==1||j==1||i==n||j==n)&&a[i][j]==0){
   		dfs(i,j);
		}
   	} 
   }
   
   for(int i=1;i<=n;i++){
  
   	for(int j=1;j<=n;j++){
   		if(a[i][j]==0&&j!=n){
   			cout<<2<<" "; 
   			continue;
   		}
   		else if(a[i][j]==0&&j==n){
   			cout<<2<<" ";
   			cout<<endl;
   			continue;
   		}
   		cout<<b[i][j]<<" ";	
   	} 
	  	cout<<endl;
   }
   return 0;
}

/**************************************************************
	Problem: 1802
	User: chenjingqi
	Language: C++
	Result: Accepted
	Time:21 ms
	Memory:2084 kb
****************************************************************/