#include <bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std;
using ll = long long;

ll get(ll l, ll r) {
    return max(0LL, r - l - 1LL);
}

int main() {
    freopen("a.in", "r", stdin), freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n;
    cin >> n;
    vector<pair<ll, int>> a;
    map<ll, bool> used;
    for (int i = 0; i < n; ++i) {
        ll l, r;
        cin >> l >> r;
        a.push_back({l, -1});
        a.push_back({r, 1});
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < 2 * n; ++i) {
        cout << a[i].first << " " << a[i].second << endl;
    }
    vector<ll> ans(n + 1);
    ll last = a[0].first;
    int bal = 0;
    for (int i = 0; i < 2 * n; ++i) {
        if (a[i].second == -1) {
            ans[bal] += get(last, a[i].first);
            used[a[i].first] = true;
            ++bal;
        } else {
            if (!used[a[i].first]) {
                used[a[i].first] = true;

            }
            --bal;
        }
        last = a[i].first;
    }
    return 0;
}