#include<bits/stdc++.h> 
using namespace std;
int n,a[35][35];
int fx[4]={0,1,0,-1},fy[4]={1,0,-1,0};
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];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){   
            if((i==1||i==n||j==1||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]==-1) cout<<0<<" ";
            else if(a[i][j]==1) cout<<1<<" ";
            else cout<<2<<" ";
        }
        cout<<endl;
    }       
}
/**************************************************************
	Problem: 1802
	User: panyuchen
	Language: C++
	Result: Accepted
	Time:17 ms
	Memory:2076 kb
****************************************************************/