#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];
void Change(int v){
	For(i,1,n){
		For(j,1,n){
			if(A[i][j] > v) 
				C[i][j] = 1;
			else if(A[i][j] < v)
				C[i][j] = -1;
			else C[i][j]= 0;
		}
	}
}
int Judge(int v){
	Change(v);
	for(int i=1; i<=n; i++)
		for(int j=1; j<=n; j++){
			if(C[i][j]==0){
				int flag=1;
				for(int xx=1; xx<=n; xx++){
					if(C[xx][j]>0||C[i][xx]<0){
						flag=0;
						break;
					}
				}
				if(flag)return 1;
			}
		}
	return 0;
	
}
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;
}