#include<bits/stdc++.h>
using namespace std;
struct str{
	long long nu,n;
};
bool cmp(str a,str b){
	return a.nu<b.nu;
}
int main(){
	freopen("labour.in","r",stdin);
	freopen("labour.out","w",stdout);
	long long n;
	cin>>n;
	str a[n+1],b[n+1];
	long long mi=10000000000;
	for(long long i=1;i<=n;i++){
		cin>>a[i].nu>>b[i].nu;
		mi=min(a[i].nu+b[i].nu,mi);
		a[i].n=i;
		b[i].n=i;
	}
	if(n==1){
		cout<<a[1].nu+b[1].nu;
		exit(0);
	}
	sort(a+1,a+n+1,cmp);
	sort(b+1,b+n+1,cmp);
	if(a[1].n==b[1].n){
		mi=min(mi,min(max(a[1].nu,b[2].nu),max(a[2].nu,b[1].nu)));
	}
	else{
		mi=min(mi,max(a[1].nu,b[1].nu));
	}
	cout<<mi;
	return 0;
}