#include <iostream>
#include <queue>
#include <map>
#include <set>
#define ll long long
using namespace std;
struct alk
{
    ll els, mas;
};
priority_queue<alk>que;
bool operator<(const alk a, const alk b)
{
    if (a.els > b.els)return true;
    else if (a.els == b.els && a.mas > b.mas)return true;
    return false;
}
struct alk2
{
    ll els, mas;
};
/*priority_queue<alk2>que2;
bool operator<(const alk2 a, const alk2 b)
{
    if (a.els < b.els)return true;
    else if (a.els == b.els && a.mas < b.mas)return true;
    return false;
}*/
map<ll,set<ll> >mp;
int main() {
    ll n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        ll a, b;
        cin >> a >> b;
       /* if (!que2.empty() && (que2.top().els <= a || que2.top().mas <= b))
        {
            que2.push({ a, b });
            que.push({ a,b });
        }
        if (que2.empty())
        {
            que2.push({ a,b });
            que.push({ a,b });
        }*/
        bool ok = false;
        mp[a].insert(b);
        for (auto& e : mp)
        {
            if (e.first > a)
            {
               auto it= e.second.upper_bound(b);
               if (it != e.second.end())
               {
                   ok = true;
                   break;
               }
            }
        }
        if (!ok)
        {
            que.push({ a,b });
            while (!que.empty() && a > que.top().els && b > que.top().mas) {
                que.pop();
            }
        }


        cout << que.size() << "\n";
    }
    return 0;
}