#include <iostream>

using namespace std;


struct point{
    int x;
    int y;
    bool operator<(const point& other) const {
        return (x < other.x)||(x==other.x && y > other.y);
    }
    bool dom(const point other){
        return x>other.x && y>other.y;
    }
};
struct elem{
    elem* nxt;
    point inf;
};
typedef elem* mutato;
mutato _list;
void init(mutato &a){
    a=new elem;
    a->nxt=NULL;
}
int len=0;
mutato find_x(mutato p, point inf){
    if (p->nxt){
        if(p->nxt->inf.dom(inf)) return NULL;
        if(inf<p->nxt->inf) return find_x(p->nxt, inf);
        return p;
    }
    return p;
}
mutato push(mutato &p, point inf){
    mutato q=new elem;
    q->inf = inf;
    q->nxt=p->nxt;
    p->nxt=q;
    return q;
}
mutato delnxt(mutato &p){
    mutato q=p->nxt;
    p->nxt=q->nxt;
    delete q;
}
bool delif(mutato &p){
    if(p&&p->nxt)
        if(p->inf.dom(p->nxt->inf)) {delnxt(p);return 1;};
    return 0;
}

int main()
{
    int n;
    cin>>n;
    point a;
    init(_list);
    cin>>_list->inf.x>>_list->inf.y;
    len++;
    for(int i=2;i<=n;i++){
        mutato m=_list;
        mutato q;
//        while(m!=NULL){
//            cout<<'('<<m->inf.x<<", "<<m->inf.y<<") ";
//            m=m->nxt;
//        }
//        cout<<endl;
        cin>>a.x>>a.y;
        if(_list->inf < a){
            q=new elem;
            q->inf=a;
            q->nxt=_list;
            _list=q;
            len++;
        }
        else{
            if(q=find_x(_list, a)){
                push(q, a);
                len++;
            }
        }
        while(delif(q)){len--;};
        cout<<len<<endl;
    }
    mutato q=_list;
//    while(q!=NULL){
//        cout<<'('<<q->inf.x<<", "<<q->inf.y<<") ";
//        q=q->nxt;
//    }
    return 0;
}