//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	template<class T,class... Args>
	inline void read(T& t,Args&... args) {
		read(t);
		read(args...);
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x) {
		if(x==0){
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		register int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
namespace G{
	int l[500002],r[500002],tl[500002],tr[500002];
}
using namespace G;
int n;
int p[500002],m,qwq[500002];
pii temp[500002];
#define mid ((l+r)>>1)
namespace B{
	int c[500002];
	inline void add(int pos,int v){
		while(pos<=m){
			c[pos]+=v;
			pos+=(-pos&pos);
		}
	}
	inline int query(int pos){
		int rt=0;
		while(pos){
			rt+=c[pos];
			pos-=(-pos&pos);
		}
		return rt;
	}
};
inline void update(int pos);
namespace S{
	pii mmin[2000002];
	inline void build(int pos,int l,int r){
		if(l==r)mmin[pos]=temp[l];
		else{
			build(pos<<1,l,mid);build(pos<<1|1,mid+1,r);
			mmin[pos]=min(mmin[pos<<1],mmin[pos<<1|1]);
		}
	}
	inline void del(int pos,int l,int r,int q){
		if(l==r)mmin[pos]=make_pair(1000000000,1000000000);
		else{
			if(q<=mid)del(pos<<1,l,mid,q);
			else del(pos<<1|1,mid+1,r,q);
			mmin[pos]=min(mmin[pos<<1],mmin[pos<<1|1]);
		}
	}
	inline pii query(int pos,int l,int r,int ql,int qr){
		if(ql<=l&&qr>=r)return mmin[pos];
		if(ql<=mid&&qr>mid)return min(query(pos<<1,l,mid,ql,qr),query(pos<<1|1,mid+1,r,ql,qr));
		if(ql<=mid)return query(pos<<1,l,mid,ql,qr);
		return query(pos<<1|1,mid+1,r,ql,qr);
	}
	inline void solve(int ql,int qr){//cerr<<"S "<<ql<<" "<<qr<<endl;
		if(ql>qr)return;
		pii x=query(1,1,m,ql,qr);//cerr<<" "<<x.first<<" "<<x.second<<endl;
		if(x.first<=qr){
			int pos=x.second;
			del(1,1,m,l[pos]);
			update(pos);
			solve(l[pos]+1,qr);
		}
	}
}
namespace M{
	set<int>x,y;
	inline pii query(int pos){//cerr<<endl<<"M "<<pos<<" ";
		auto a=x.upper_bound(pos),b=y.upper_bound(pos);
		return make_pair(b==x.end()?m+1:tr[*b],a==x.begin()?0:*--a);
	}
	inline void ins(int pos){
		x.insert(l[pos]);
		y.insert(r[pos]);
	}
	inline void del(int pos){
		x.erase(l[pos]);
		y.erase(r[pos]);
	}
}
namespace R{
	inline void solve(int l,int r);
}
namespace Q{
	int tag[2000002];
	pii mmin[2000002];
	inline void pushdown(int pos){
		if(tag[pos]){
			tag[pos<<1]+=tag[pos];
			tag[pos<<1|1]+=tag[pos];
			mmin[pos<<1].first+=tag[pos];
			mmin[pos<<1|1].first+=tag[pos];
			tag[pos]=0;
		}
	}
	inline void pushup(int pos){
		mmin[pos]=min(mmin[pos<<1],mmin[pos<<1|1]);
	}
	inline void build(int pos,int l,int r){
		if(l==r)mmin[pos]=make_pair(2100000000,2100000000);
		else{
			build(pos<<1,l,mid);build(pos<<1|1,mid+1,r);pushup(pos);
		}
	}
	inline void add(int pos,int l,int r,int ql,int qr,int v){
		if(ql<=l&&qr>=r)tag[pos]+=v,mmin[pos].first+=v;
		else{
			pushdown(pos);
			if(ql<=mid)add(pos<<1,l,mid,ql,qr,v);
			if(qr>mid)add(pos<<1|1,mid+1,r,ql,qr,v);
			pushup(pos);
		}
	}
	inline void add(int l,int r,int v){
		if(l<=r)add(1,1,m,l,r,v);
	}
	inline void del(int pos,int l,int r,int q){
		if(l==r){
			mmin[pos]=make_pair(2100000000,2100000000);
		}else{
			pushdown(pos);
			if(q<=mid)del(pos<<1,l,mid,q);
			else del(pos<<1|1,mid+1,r,q);
			pushup(pos);
		}
	}
	inline void ins(int pos,int l,int r,int q,int v){
		if(l==r){
			mmin[pos]=make_pair(B::query(G::r[v]-1)-B::query(G::l[v]-1),v);
		}else{
			pushdown(pos);
			if(q<=mid)ins(pos<<1,l,mid,q,v);
			else ins(pos<<1|1,mid+1,r,q,v);
			pushup(pos);
		}
	}
	int now;
	inline void solve(){
		int pos=mmin[1].second;
#ifdef LOCAL
		printf("getans                          ");write(pos,'\n');
#else
		write(pos,' ');
#endif
		if((++now)==n)return;
		del(1,1,m,l[pos]);
		R::solve(l[pos],r[pos]);
		M::del(pos);
		S::del(1,1,m,l[pos]);
		auto pre=M::x.lower_bound(l[pos]),suf=M::y.upper_bound(r[pos]);//cerr<<l[pos]<<" "<<suf<<" ";
		S::solve((pre==M::x.begin()?0:*--pre)+1,(suf==M::y.end()?m+1:*suf)-1);
	}
}
namespace R{
	set<int>res;
	inline void solve(int l,int r){
		for(auto i=res.lower_bound(l),iend=res.lower_bound(r);i!=iend;++i){
			B::add(*i,p[*i]-p[*i+1]);//cerr<<"solved "<<*i<<" "<<*i+1<<" "<<p[*i]<<" "<<p[*i+1]<<" ";
			pii v=M::query(*i);//cerr<<v.first<<" "<<v.second<<endl;
			Q::add(v.first,v.second,p[*i]-p[*i+1]);
		}
		res.erase(res.lower_bound(l),res.lower_bound(r));
	}
}
inline void update(int pos){//cerr<<"update "<<pos<<endl;
	Q::ins(1,1,m,l[pos],pos);
	M::ins(pos);
}
int main() {
	cin>>n;
	F(i,1,n)read(l[i],r[i]),p[++m]=l[i],p[++m]=r[i];
	sort(p+1,p+m+1);
	p[m+1]=1000000000;//F(i,1,m)cerr<<p[i]<<" ";cerr<<endl;
	F(i,1,m)qwq[i]=i;
	F(i,1,n)r[i]=(qwq[lower_bound(p+1,p+m+1,r[i])-p]++);
	UF(i,n,1)l[i]=(qwq[lower_bound(p+1,p+m+1,l[i])-p]++);
	F(i,1,n)tl[l[i]]=i,tr[r[i]]=l[i];
	F(i,1,m)B::add(i,p[i+1]-p[i]),R::res.insert(i);
	memset(temp,0x3f,sizeof(temp));
	memset(Q::mmin,0x7f,sizeof(Q::mmin));
	F(i,1,n)temp[l[i]]=make_pair(r[i],i);//,cerr<<"    "<<l[i]<<" "<<r[i]<<endl;
	S::build(1,1,m);
	F(i,1,n){
		auto pos=M::x.lower_bound(l[i]);//cerr<<tl[*pos]<<endl;
		if(pos==M::x.end()||r[tl[*pos]]>r[i]){
			update(i);
			S::del(1,1,m,l[i]);
		}
	}
	F(i,1,n)Q::solve();
	return 0;
}
/*
4
3 5
4 6
5 7
3 7
*/