#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 200'001;

set<int> a;
multiset<int> b[MAXN];
int vx[MAXN], vy[MAXN];
int curr = 0;

void del(int x, int y) {
    auto it = a.lower_bound(x);
    while (it != a.begin()) {
        it--;
        int val = *it;
        auto it2 = b[val].begin();
        while (it2 != b[val].end() && (*it2) < y) {
            curr--;
            it2 = b[val].erase(it2);
        }
        if (b[val].empty()) {
            a.erase(val);
            it = a.lower_bound(x);
        } else {
            break;
        }
    }
}

void insert(int x, int y) {
    curr++;
    a.insert(x);
    b[x].insert(y);
}

void add(int x, int y) {
    auto it = a.upper_bound(x);
    if (it == a.end()) {
        insert(x, y);
    } else {
        int val = *it;
        if ((*b[*it].rbegin()) <= y) {
            insert(x, y);
        }
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<int> comp;
    for (int i = 1; i <= n; i++) {
        cin >> vx[i] >> vy[i];
        comp.emplace_back(vx[i]);
    }
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    for (int i = 1; i <= n; i++) vx[i] = lower_bound(comp.begin(), comp.end(), vx[i])-comp.begin();
    for (int i = 1; i <= n; i++) {
        del(vx[i], vy[i]);
        add(vx[i], vy[i]);
        cout << curr << "\n";
    }
    return 0;
}