#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const int MAXN = 1e5 + 5;

int a[2 * MAXN], n, cnt;

int main() {
    freopen ("linear.in", "r", stdin);
    freopen ("linear.out", "w", stdout);
    scanf ("%d", &n);
    for (int i = 1; i <= n; i++) {
        int l, r;
        scanf ("%d%d", &l, &r);
        a[++cnt] = l;
        a[++cnt] = r;
    }
    
    sort (a + 1, a + cnt + 1);
    
    printf ("%d %d\n", a[n], a[n + 1]);
    fclose (stdin);
    fclose (stdout);
    return 0;
}