#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll N;
    cin >> N;
    V<ll> A(N), B(N);
    REP(i, N) cin >> A[i] >> B[i];

    ll res = INF;

    REP(i, N) chmin(res, A[i]+B[i]);

    REP(i, N){
        REP(j, N){
            if(i != j){
                chmin(res, max(A[i], B[j]));
            }
        }
    }

    cout << res << endl;

    return 0;
}
#include<bits/stdc++.h>
#define ll long long int
#define lb long long double
#define mp make_pair
#define MOD 1000000007
#define pb push_back
#define ppi pair<ll,pair<ll,ll>>
#define F(i,n) for(ll i=0;i<n;i++)
#define w(t) ll t;cin >> t;while(t--) 
using namespace std;

vector<ll> divisor;
void getDivisors(ll n) 
{
    for (ll i=1; i<=sqrt(n); i++) 
    { 
        if (n%i == 0) 
        { 
            // If divisors are equal, take only one 
            if (n/i == i) 
                divisor.push_back(i); 
  
            else // Otherwise take both 
            {
                divisor.push_back(i);
                divisor.push_back(n/i);
            }
        } 
    } 
} 
  

int main()
{
        
    //w(t)
    {
      
        //cout << "Codeforces Higher rating" << endl;
        ll n;
        cin >> n;
        vector<ll> a(n),b(n);
        for(int i = 0 ; i < n ; i = i + 1){
            
            cin >> a[i] >> b[i];
        } 
        if(n == 1)
        {
            cout << a[0] + b[0] << endl;
            return 0;
        }
    
        int min1ind = min_element(a.begin(),a.end()) - a.begin();
        int min2ind = min_element(b.begin(),b.end()) - b.begin();
        
        int x = (a[min1ind] + b[min2ind]);
        if(min1ind != min2ind) cout << max(a[min1ind],b[min2ind]) << endl;
        else 
        {
            sort(a.begin(),a.end());
            sort(b.begin(),b.end());
            
            cout << min(x,(int)min(max(a[0],b[1]),max(a[1],b[0]))) <<endl;
        }
        
    } 
    
} 