#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

struct node
{
    int x;
    int y;
    int z;
};

bool cmp(node a,node b)
{
    int a1;
    int b2;
    a1=a.x-a.y;
    b2=b.x-b.y;
    if(a1!=b2)return a1>b2;
    else
    {
        if(a.y!=b.y)return a.y<b.y;
        else return a.z<b.z;
    }
}

int main()
{
    node itv[110];
    int n;
    //freopen("321001.txt","r",stdin);
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
            {
                scanf("%d%d",&itv[i].x,&itv[i].y);
                itv[i].z=i;
            }
        sort(itv,itv+n,cmp);
        for(int i=0;i<n;i++)
        {
            printf("%d",itv[i].z);
            if(i==n-1)printf("\n");
            else printf(" ");
        }
    }
    return 0;
}