#include <iostream>

#include <vector>

using namespace std;

bool isSafe(int row, int col, int n, vector<vector<int>>& maze, vector<vector<bool>>& visited) {
    return (row >= 0 && col >= 0 && row < n && col < n && 
            maze[row][col] == 1 && !visited[row][col]);
}
void solve(int row, int col, int n, vector<vector<int>>& maze,
           vector<vector<bool>>& visited, vector<vector<int>>& result) {
    if (row == n-1 && col == n-1) {
        result[row][col] = 1;  
        return;

    }

    // Mark current cell

    visited[row][col] = true;

    result[row][col] = 1;

    // Try Down

    if (isSafe(row+1, col, n, maze, visited)) {
        solve(row+1, col, n, maze, visited, result);
    }
    if (isSafe(row, col+1, n, maze, visited)) {
        solve(row, col+1, n, maze, visited, result);
    }
    if (isSafe(row-1, col, n, maze, visited)) {
        solve(row-1, col, n, maze, visited, result);
    }
    if (isSafe(row, col-1, n, maze, visited)) {
        solve(row, col-1, n, maze, visited, result);
    }
    result[row][col] = 0;
    visited[row][col] = false;
    

}

int main() {

    int n;

    cin >> n;

    

    vector<vector<int>> maze(n, vector<int>(n));

    for (int i = 0; i < n; i++) {

        for (int j = 0; j < n; j++) {

            cin >> maze[i][j];

        }

    }

    vector<vector<bool>> visited(n, vector<bool>(n, false));

    vector<vector<int>> result(n, vector<int>(n, 0));

    // Start from (0,0)

    if (maze[0][0] == 1 && solve(0, 0, n, maze, visited, result)) {

        // Print the path

        for (int i = 0; i < n; i++) {

            for (int j = 0; j < n; j++) {

                cout << result[i][j] << " ";

            }

            cout << endl;

        }

    } else {

        cout << "No path exists!" << endl;

    }

    return 0;

}