#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
//#define double long double

const int maxn = 55;

int n;
int a[maxn][maxn];

int lk[maxn][maxn],vis[maxn],match[maxn];
int dfs(const int x)
{
	if(vis[x]) return 0;
	vis[x]=1;
	for(int j=1;j<=n;j++) if(lk[x][j])
	{
		if(!match[j] || dfs(match[j]))
		{
			match[j]=x;
			return 1;
		}
	}
	return 0;
}
int check(const int mid)
{
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++)
		lk[i][j]= (a[i][j]<=mid);
	memset(match,0,sizeof match);
	int num=0;
	for(int i=1;i<=n;i++)
	{
		memset(vis,0,sizeof vis);
		num+=dfs(i);
	}
	return num==n;
}

signed main()
{
	/////////////////////////////////////////////////
	//freopen("tmp.in","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	vector<int>val;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) 
	{
		cin>>a[i][j];
		val.push_back(a[i][j]);
	}
	sort(val.begin(),val.end());
	
	int l=0,r=(int)val.size()-1;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(check(val[mid])) r=mid-1;
		else l=mid+1;
	}
	cout<<val[r+1]<<endl;
	
	return 0;
}