#include "stdafx.h"
#include <algorithm>
#include <iostream>

using namespace std;

const int N = 1e3;
int a[N][N], b[N][N];

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int maxij = 0;
            for (int k = 0; k < n; k++) {
                maxij = max(maxij, a[i][k]);
            }
            for (int k = 0; k < n; k++) {
                maxij = max(maxij, a[k][j]);
            }
            b[i][j] = maxij;
        }
    }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                cout << b[i][j] << " ";
            }
            cout << endl;
        }

    return 0;
}