#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<iostream>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
void gn(int &x){
    char c;while((c=getchar())<'0'||c>'9');x=c-'0';
    while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';
}
int n;
struct node{
    int a,b,i;
}a[5000005];
int cmp(const node&a,const node&b){
    if(a.a-a.b!=b.a-b.b)return a.a-a.b>b.a-b.b;
    else if(a.b!=b.b)return a.b<b.b;
    else return a.i<b.i;
}
int main()
{
    while(scanf("%d",&n)!=EOF){
        for (int i=0;i<n;i++){
            scanf("%d%d",&a[i].a,&a[i].b);
            a[i].i=i;
        }
        sort(a,a+n,cmp);
        for (int i=0;i<n;i++){
            if(!i)printf("%d",a[i].i);
            else printf(" %d",a[i].i);
        }
        printf("\n");
    }
    return 0;
}