#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<cmath>
#include<cctype>
#include<ctime>
#include<bitset>
using namespace std;
const int maxlongint=2147483647;
const int inf=1000000000;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
piii p[100010];
int main()
{
    int n,n1,t1,t2;
    while(scanf("%d",&n)==1)
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&t1,&t2);
            p[i].first.first=t2-t1;
            p[i].first.second=t2;
            p[i].second=i;
        }
        sort(p+1,p+n+1);
        for(n1=1;n1<n;n1++)
            printf("%d ",p[n1].second-1);
        printf("%d\n",p[n].second-1);
    }
}