#include <bits/stdc++.h>

using namespace std;

const int N = 55;

int n, a[N][N];

void solve(){
    cin >> n;
    for (int i = 1; i <= n; ++ i){
        for (int j = 1; j <= n; ++ j) cin >> a[i][j];
    }
    int mxR = 0, mnC = N * N;
    for (int i = 1; i <= n; ++ i){
        int C = 0, R = N * N;
        for (int j = 1; j <= n; ++ j){
            R = min(R, a[i][j]);
            C = max(C, a[j][i]);
        }
        mnC = min(mnC, C);
        mxR = max(mxR, R);
    }
    assert(mnC < mxR);
    cout << mxR;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}