#include<iostream>
#include<cstring>
using namespace std;
int mp[35][35];
bool vis[35][35];
int n;
int dx[4] = {0,1,0,-1};
int dy[4] = { 1,0,-1,0};
void dfs(int x, int y) {
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i], ny = y + dy[i];
        if (mp[nx][ny] == 1 || vis[nx][ny]||nx<0||nx>n-1||ny<0||ny>n-1) return;
        dfs(nx, ny);
        vis[nx][ny] = true;
    }
}
int main() {
    cin >> n;
    memset(vis, false, sizeof(vis));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++) {
            cin >> mp[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!vis[i][j]&&(mp[i][j] == 0 && i == 0 || mp[i][j] == 0 && i == n - 1 || mp[i][j] == 0 && j == 0 || mp[i][j] == 0 && j == n - 1))
            {
                vis[i][j] = true;
                dfs(i, j);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (mp[i][j] == 1||vis[i][j])
                cout << mp[i][j]<<" ";
            else cout << 2<<" ";
        }
        cout << endl;
    }
}