vector<pair<int, pair<int, int>>> v;
for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
       int a;
       cin >> a;
       if (i < j) {
         v.pb({a, {i, j}});
       }
    }
}

sort(all(v));

for (auto [a, ij] : v) {
    auto [i, j] = ij;
    i = dsu.find_set(i);
    j = dsu.find_set(j);
    if (i == j) {
       cout << a;
       return;
    }

    if (opp[i] != -1) {
       dsu.merge(opp[i], j);
    }
    if (opp[j] != -1) {
       dsu.merge(opp[j], i);
    }

    i = dsu.find_set(i);
    j = dsu.find_set(j);

    assert(i != j);

    opp[j] = i;
    opp[i] = j;
}
assert(0);

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N=505;

vector<int> g[N];
int color[N];
int yes;

void dfs(int at){
  for (auto x : g[at]){
    if(!color[x]){
      color[x] = -1*color[at];
      dfs(x);
    }
    else if(color[x] == color[at]){ 
      yes = 0;  
      return ;
    }
  }
}

int main(){
  ios::sync_with_stdio(0), cin.tie(0);
  
  int n;  cin >> n;
  ll a[n][n];
  for (int i = 0; i < n; ++i){
    for (int j = 0; j < n; ++j){
      cin >> a[i][j];
    }
  }

  ll lo=0, hi=1e9+9;
  while (lo<=hi){
    ll mid = (lo+hi)/2;

    for (int i = 0; i < N; ++i){
      g[i].clear();
    }

    for (int i = 0; i < n; ++i){
      for (int j = 0; j < i; ++j){
        if(a[i][j]<mid){
          g[i].push_back(j);
          g[j].push_back(i);
        }
      }
    }

    yes=1;
    memset(color, 0, sizeof(color));
    color[0]=1;
    dfs(0);
    if(yes) lo = mid+1;
    else  hi = mid-1;

  }
  cout << hi << endl;
  
  return 0;
}