#include <bits/stdc++.h>
#define int long long
#define For(x, l, r) for(int x = l; x <= r; x++)
using namespace std;
const int N = 52;
int n;
int A[N][N];
int C[N][N];
int Row[N],Col[N];
int banRow[N],banCol[N];
void Markrow(int x){
	banRow[x] = 1;
	For(j,1,n)
		C[x][j] = -1;
}
void Markcol(int y){
	banCol[y] = 1;
	For(i,1,n) 
		C[i][y] = -1;
}
void upd(){
	For(i,1,n) Row[i] = Col[i] = 0;
	For(i,1,n){
		For(j,1,n){
			if(C[i][j] == -1) 
				continue;
			if(C[i][j] == 0){
				Row[i]++;
			}
			else{
				Col[j]++;
			}
		}
	}
}
void Change(int v){
	For(i,1,n){
		For(j,1,n){
			if(A[i][j] >= v) 
				C[i][j] = 1;
			else 
				C[i][j] = 0;
		}
	}
}
int Judge(int v){
	For(i,1,n)
		banRow[i] = banCol[i] = 0;
	Change(v);
	upd();
	For(step,1,n-1){
		int maxx = -1;
		int maxpos = 0;
		For(i,1,n){
			if(banRow[i]) continue;
			if(Row[i] >= maxx){
				maxx = Row[i];
				maxpos = i;
			}
		}
		Markrow(maxpos); upd();
		maxx = -1;
		maxpos = 0;
		For(i,1,n){
			if(banCol[i]) continue;
			if(Col[i] >= maxx){
				maxx = Col[i];
				maxpos = i;
			}
		}
		Markcol(maxpos); upd();
	}
	int t = -1;
	For(i,1,n)
		For(j,1,n)
			if(C[i][j] != -1){
				t = C[i][j];
				break;
			}
	assert(t != -1);
	return t;
}
signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
//	freopen("b.out","w",stdout);
	auto start = std::chrono::high_resolution_clock::now();
#endif
	cin >> n;
	int minn = 1e9;
	int maxx = -1;
	For(i,1,n){
		For(j,1,n){
			cin >> A[i][j];
			minn = min (minn,A[i][j]);
			maxx = max (maxx,A[i][j]);
		}
	}
	int l = minn ,r = maxx;
	int ans = 0;
	while(l <= r){
		int mid = (l + r) >> 1;
		if(Judge(mid)){
			ans = mid ;
			l = mid + 1;
		}
		else 
			r = mid - 1;
	}
	cout << ans << '\n';
#ifdef NICEGUODONG
	auto end = std::chrono::high_resolution_clock::now();
	std::chrono::duration<double> duration = end - start;
	std::cerr << "Runtime: " << duration.count() << " sec" << std::endl;
#endif

	return 0;
}