#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 true;

    }
    visited[row][col] = true;
    result[row][col] = 1;

    if (isSafe(row+1, col, n, maze, visited)) {
        solve(row+1, col, n, maze, visited, result);
        // if (solve(row+1, col, n, maze, visited, result))
            // return true;
    }
    if (isSafe(row, col+1, n, maze, visited)) {
        solve(row+1, col, n, maze, visited, result)
        // if (solve(row, col+1, n, maze, visited, result))
            // return true;
    }
    if (isSafe(row-1, col, n, maze, visited)) {
        solve(row+1, col, n, maze, visited, result)
        // if (solve(row-1, col, n, maze, visited, result))
            // return true;
    }
    if (isSafe(row, col-1, n, maze, visited)) {
        solve(row+1, col, n, maze, visited, result);
        // if (solve(row, col-1, n, maze, visited, result))
            // return true;
    }
    result[row][col] = 0;
    visited[row][col] = false;
    // return 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));
    if (maze[0][0] == 1) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                cout << result[i][j] << " ";
            }
            cout << endl;
        }
    } else {
        cout << "No path found" << endl;
    }
    return 0;
}