#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;

struct Block {
    const int N, B;
    vector<int> range;
    struct J {
        int nextr, step, pos;
        J(int nextr = inf, int step = 0, int pos = -1)
            : nextr(nextr), step(step), pos(pos) {}
        friend ostream &operator<<(ostream &out, J &j) {
            out << "{" << j.nextr << ' ' << j.step << ' ' << j.pos << "}";
            return out;
        }
    };
    vector<J> jump;
    Block(int n)
        : N(n), B(max(1, (int)sqrtl(n))), range(n + 1, n + 1), jump(n + 1) {
        for (int i = n / B; i >= 0; i--) {
            build(i);
        }
    }
    void build(int x, int pos = inf) {
        int l = x * B, r = min(N, l + B - 1);
        pos = min(pos, r);
        for (int i = pos; i >= l; i--) {
            if (i == r) {
                jump[i] = J(N + 2, 0, N + 2);
            } else {
                jump[i] = jump[i + 1];
            }
            if (range[i] + 1 < jump[i].nextr) {
                jump[i].nextr = range[i] + 1;
                if (range[i] + 1 <= r) {
                    jump[i].step = jump[range[i] + 1].step + 1;
                    jump[i].pos = jump[range[i] + 1].pos;
                } else {
                    jump[i].step = 1;
                    jump[i].pos = range[i] + 1;
                }
            }
        }
#ifdef DEBUG
        cerr << "build block " << x << '\n';
        for (int i = l; i <= r; i++) {
            cerr << jump[i] << ' ';
        }
        cerr << endl;
#endif
    }
    void add(int l, int r) {
        range[l] = min(range[l], r);
        build(l / B, l);
    }
    int query() const {
        int res = 0, lst = 0, pos = N + 2;
        for (int i = 0; i <= N / B; i++) {
            if (jump[i * B].nextr < pos) {
                res += max(lst - 1, 0);
                lst = jump[i * B].step;
                pos = jump[i * B].pos;
            } else if (pos <= N && pos / B == i) {
                res += lst;
                lst = jump[pos].step;
                pos = jump[pos].pos;
            }
#ifdef DEBUG
            cerr << "block " << i << ": res = " << res << ", pos = " << pos
                 << endl;
#endif
        }
        return res + lst;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<pair<int, int>> p(n);
    int mx = 0;
    for (auto &[l, r] : p) {
        cin >> l >> r;
        mx = max(mx, r);
    }
    Block b(mx);
#ifdef DEBUG
    cerr << "block size = " << b.B << endl;
#endif
    for (int i = 0; i < n; i++) {
        b.add(p[i].first, p[i].second);
        cout << b.query() << '\n';
    }
    return 0;
}