#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct Guest {
    int arrival;
    int departure;
};

int main() {
    int n;
    cin >> n;
    vector<Guest> guests(n);
    for (int i = 0; i < n; i++) {
        cin >> guests[i].arrival >> guests[i].departure;
    }

    sort(guests.begin(), guests.end(), [](const Guest& a, const Guest& b) {
        return a.arrival < b.arrival;
    });

    int maxOverlap = 0;
    int overlap = 0;
    int start = guests[0].arrival;
    int end = guests[0].departure;
    int bestStart = start;
    int bestEnd = end;
    for (int i = 1; i < n; i++) {
        if (guests[i].arrival <= end) {
            overlap++;
            end = max(end, guests[i].departure);
        } else {
            if (overlap > maxOverlap) {
                maxOverlap = overlap;
                bestStart = start;
                bestEnd = end;
            }
            overlap = 0;
            start = guests[i].arrival;
            end = guests[i].departure;
        }
    }

    if (overlap > maxOverlap) {
        maxOverlap = overlap;
        bestStart = start;
        bestEnd = end;
    }

    cout << maxOverlap+1 << endl;
    cout << bestStart << " " << bestEnd;

    return 0;
}