#ifdef GCC_VERSION 
#include<bits/stdc++.h>
#endif

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
#include <algorithm>
#include <functional>
#include <deque>
#include <queue>
#include <cstring>
#include <chrono>
#include <numeric>

#ifdef _DEBUG
#define DEBUG_INPUT
#endif

#ifdef DEBUG_INPUT
#include "../__common/Helper.h"
#endif

using ll = long long int;
using ld = long double;

static const ll INF = 6'000'000'000'000'000'000; // -INF for min value

template<typename T> using Vec = std::vector<T>;
template<typename T> using VecVec = std::vector<std::vector<T>>;

#define fe(e,cont) for(auto& e : cont) // others loop types by snippets
#define all(v) std::begin(v),std::end(v)

// only for md-arrays
template<class T> void unsafe_clear(T& val) { auto sz = sizeof(val); std::memset(&val, 0, sz); }
template<class T1, class T2> bool isMemEqual(const T1& v1, const T2& v2) { static_assert(sizeof(v1) == sizeof(v2)); return std::memcmp(&v1, &v2, sizeof(v1)) == 0; }

ll ipow(ll v, ll p) { ll res = 1; while (p--) { res *= v; } return res; }
ll div_ceil(ll a, ll b) { ll res = a / b; if (res * b != a) res++; return res; }

class Timer { // Sometimes measurement is required...
    using sc = std::chrono::steady_clock;  sc::time_point start;
public:
    Timer() :start(sc::now()) {}
    ll elapsedMs() { return std::chrono::duration_cast<std::chrono::milliseconds>(sc::now() - start).count(); }
};

extern const char* INPUT_DATA;

#ifdef DEBUG_INPUT
static Helper helper(INPUT_DATA);
#endif

template<class T>
T __get() {
#ifdef DEBUG_INPUT     
    return helper.get<T>();
#else
    T val; std::cin >> val; return val;
#endif
}

ll get() { return __get<ll>(); }
std::string gets() { return __get<std::string>(); }
std::tuple<ll, ll> get2() { return { get(), get() }; } std::tuple<ll, ll, ll> get3() { return { get(), get(), get() }; } std::tuple<ll, ll, ll, ll>
get4() { return { get(), get(), get(), get() }; } std::tuple<ll, ll, ll, ll, ll> get5() { return { get(), get(), get(), get(), get() }; }

template<class T> void print(const T& val) { std::cout << val << " "; }
template<class T, class ... Types> void print(const T& var, const Types&...var2) { print(var); print(var2...); }
void endl() { std::cout << "\n"; }

void onetime(); void prepare() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr);  std::cout.tie(nullptr); onetime(); }
void task(); void tcase() { ll t = get(); while (t--) task(); }



int main() {
    Timer timer; prepare();
    //tcase();
    task();
#ifdef DEBUG_INPUT
    while (helper.hasInput()) task();
    //print("Execution time:", timer.elapsedMs());
#endif
    return 0;
}

//-------------------------------------------------------------

void onetime()
{
}


const char* INPUT_DATA = R"(
4 9 9
5 5
15 5
5 15
15 15

)";



void task()
{
    auto [n, S, D] = get3();
    bool f = false;
    for (ll i = 0; i < n; i += 1)
    {
        ll s = get();
        ll d = get();

        if (s < S && d > D)
        {
            f = true;
        }
    }

    print(f?"Yes":"No");

}


#include<bits/stdc++.h>
using namespace std;
int const maxn = 1e6+10;
long double const eps = 1e-3;
#define ll long long
int a[1100];
int b[1100];

int main(){
	int n;
	cin>>n;
	int mini2=1e9;
	int mini=1e9;
	for(int i=1;i<=n;i++){

        scanf("%d%d",&a[i],&b[i]);
         mini=min(mini,a[i]+b[i]);
	}
	for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j) continue;
            mini2=min(mini2,max(a[i],b[j]));
        }
	}
	cout<<min(mini,mini2)<<endl;
	return 0;
}
