#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main() {
int n;
cin>>n;
vector<vector<int>> time(n,vector<int>(n));
for (int i=0;i<n;++i) {
for (int j=0;j<n;++j) {
cin>>time[i][j];
}
}
vector<int> c(n,0);
vector<bool> ok(n,false);
for (int j=0;j<n;++j) {
int m=INT_MAX;
int a=-1;
int p=-1;
for (int i=0;i<n;++i) {
if (!ok[i] && time[i][j]<m) {
m=time[i][j];
a=j;
p=i;
}
}
if (p!=-1) {
c[a]=time[p][a];
ok[p]=true;
}
}
int t=*max_element(c.begin(),c.end());
cout<<t<<endl;
return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n;
long long ln = LLONG_MAX;
int main() {
    cin >> n;
    vector<vector<int>> a(n, vector<int>(n));
    vector<int> c(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> a[i][j];
        }
    }
    iota(c.begin(), c.end(), 0);
    do {
        int mx = 0;
        for (int i = 0; i < n; ++i) {
            mx = max(mx, a[i][c[i]]);
        }
        ln = min(ln, (long long)mx);
    } while (next_permutation(c.begin(), c.end()));
    cout << ln ;
    return 0;
}