#include <fstream>
#define nmx 260
using namespace std;

int streets[nmx][nmx];
int mAd[nmx][nmx];
int distances[nmx][nmx];

int main() {
    ifstream f("rf.in");
    ofstream g("rf.out");
    int n;
    f >> n;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            f >> mAd[i][j];
            if(mAd[i][j]){
                distances[i][j] = mAd[i][j];
                streets[i][j] = 1;
            }
        }
    }

    for(int k = 1; k <= n; ++k){
        for(int i = 1; i <= n; ++i){
            for(int j = 1; j <= n; ++j){
                if(distances[i][k] + distances[k][j] < distances[i][j]){
                    distances[i][j] = distances[j][i] = distances[i][k] + distances[k][j];
                    streets[i][j] = streets[j][i] = streets[i][k] + streets[k][j];
                }
                else if(distances[i][k] + distances[k][j] == distances[i][j] && streets[i][k] + streets[k][j] > streets[i][j]){
                    streets[i][j] = streets[j][i] = streets[i][k] + streets[k][j];
                }
            }
        }
    }
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            g << distances[i][j] << " ";
        }
        g << "\n";
    }

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            g << streets[i][j] << " ";
        }
        g << "\n";
    }
    return 0;
}