#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cstdlib>
using namespace std;
int m,n,k1=0,k2=0,k3=0,min=9999999;
long long a[100005],b[100005],c[100005],k[100005],xu[100005];
bool bb[100005];
int min1(int a,int b,int cc)
{
	if(a<=b&&a<=cc)return a;
	if(a>=b&&b<=cc)return b;
	if(cc<=a&&cc<=b)return cc;
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>a[i]>>b[i]>>c[i];
		k[i]=min1(a[i],b[i],c[i]);
		if(a[i]<b[i]&&a[i]<c[i])xu[i]=1;
		if(c[i]<b[i]&&a[i]>c[i])xu[i]=2;
		if(a[i]>b[i]&&b[i]<c[i])xu[i]=3;
	}
	int sum=0;
	for(int i=1;i<=m;i++)
		if(xu[i]==1)
		{
			sum++;
			if(k[i]>k1)k1=k[i];
		}
	for(int i=1;i<=m;i++)
	{
		if(xu[i]!=1&&a[i]<=k1)sum++;
		if(sum==m){
			cout<<k1<<endl;
			return 0;
		}
	}
	sum=0;
	for(int i=1;i<=m;i++)
		if(xu[i]==2)
		{
			sum++;
			if(k[i]>k2)k2=k[i];
		}
	for(int i=1;i<=m;i++)
	{
		if(xu[i]!=2&&b[i]<=k2)sum++;
		if(sum==m){
			cout<<k2<<endl;
			return 0;
		}
	}
	sum=0;
	for(int i=1;i<=m;i++)
		if(xu[i]==3)
		{
			sum++;
			if(k[i]>k3)k3=k[i];
		}
	for(int i=1;i<=m;i++)
	{
		if(xu[i]!=3&&c[i]<=k3)sum++;
		if(sum==m){
			cout<<k3<<endl;
			return 0;
		}
	}
}