#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;   typedef pair<int,int>pint;  typedef long double ld;   
using vll=vector<ll>;   using vs=vector<string>;
#define b2e(v)v.begin(),v.end()
#define p2a(v, p) v[p.first][p.second]

class var { public: ll min,max,ct,sum,dif,result; };
int main() {
    ll n;
    cin>>n;
    vector<pint> v;

    const int INF=0x3f3f3f3f;
    const ll INFL=0x3f3f3f3f3f3f3f3f;
    pint lmax={INF,INF},idx={0,0};
    rep(i,n) {
        ll a,b;
        cin >> a >> b;
        if (lmax.first > a) { lmax.first=a; idx.first=i; }
        if (lmax.second > b) { lmax.second=b; idx.second=i; }
        v.push_back({a,b});
    }

    pint lmax2={INF,INF};
    rep(i,n) {
        ll a=v[i].first,b=v[i].second;
        if (idx.first!=i && lmax2.first > a) { lmax2.first=a; }
        if (idx.second!=i && lmax2.second > b) { lmax2.second=b; }
    }
    ll result = min(max(lmax.first,lmax2.second),max(lmax2.first,lmax.second));
    if (idx.first!=idx.second) {
        result = max(lmax.first, lmax.second);
    } else {
        result = min(lmax.first+lmax.second, min(max(lmax.first,lmax2.second), max(lmax2.first,lmax.second)));
    }
    cout << result << endl;
}

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<ll> vll;

typedef vector<vi> vvi;
typedef vector<vll> vvll;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef vector<pii> vpii;
typedef vector<pll> vpll;

typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;

#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second

template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}

    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}

    #ifdef ljuba
    #define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
    #else
    #define dbg(x...)
    #endif
}

using namespace debug;

const char nl = '\n';

void solve() {
    int n;
    cin >> n;
    vpii v(n);
    for(auto &[a, b] : v)
        cin >> a >> b;

    int ans = 1e9;
    for(auto [a, b] : v) {
        ckmin(ans, a + b);
    }

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            if(i == j)
                continue;
            ckmin(ans, max(v[i].fi, v[j].se));
        }
    }

    cout << ans << nl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef ljuba
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("error.txt", "w", stderr);
#endif

    int testCases = 1;
//    cin >> testCases;
    while(testCases--)
        solve();

}