#include <bits/stdc++.h>
#define int long long
#define lowbit(x) x & (-x)
using namespace std;
const int mod = 1000000007;

int a[1001][1001];
void solve() {
    int n; cin >> n;
    vector<int>mr(n + 1, 1000001),mc(n + 1, 1000001);
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            cin >> a[i][j];
            if(a[i][j] >= 0) mr[i] = min(mr[i],a[i][j]);
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            a[i][j] -= mr[i];
        }
    }
    for(int j = 1; j <= n; j++) {
        for(int i = 1; i <= n; i++) {
            if(a[i][j] >= 0) mc[j] = min(mc[j], a[i][j]);
        }
    }
    for(int j = 1; j <= n; j++) {
        for(int i = 1; i <= n; i++) {
            a[i][j] -= mc[j];
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(a[i][j] < 0) cout << -a[i][j] - 1 << 'n';
        } 
    }
}


signed main() {
	ios::sync_with_stdio(false);
	int tt = 1;
	// cin >> tt;
	while (tt--) {
		solve();
	}
}