#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>

#define N 105
#define M 10005
#define mod 1000000007
//#define p 10000007
//#define mod2 1000000009
#define ll long long
#define ull unsigned long long
#define LL long long
#define eps 1e-6
//#define inf 2147483647
#define maxi(a,b) (a)>(b)? (a) : (b)
#define mini(a,b) (a)<(b)? (a) : (b)

using namespace std;

int n;
vector<int> a[2*N][N];

void ini()
{
    int i,j;
    for(i=0;i<=200;i++){
        for(j=0;j<=200;j++){
            a[i][j].clear();
        }
    }
}

void solve()
{
    int i;
    int x,y;
    for(i=0;i<n;i++){
        scanf("%d%d",&x,&y);
        a[x-y+100][y].push_back(i);
    }
}

void out()
{
    int ff;
    ff=0;
    //int tot=0;
    int i,j;
    vector<int>::iterator it;
    for(i=200;i>=0;i--){
        for(j=0;j<=100;j++){
            for(it=a[i][j].begin();it!=a[i][j].end();it++){
                if(ff==0){
                    ff=1;
                    printf("%d",*it);
                }
                else{
                    printf(" %d",*it);
                }
            }
        }
    }
    printf("\n");
}

int main()
{
    //freopen("data.in","r",stdin);
    //freopen("data.out","w",stdout);
    //scanf("%d",&T);
    //for(int ccnt=1;ccnt<=T;ccnt++)
    //for(cnt=1;cnt<=T;cnt++)
    //scanf("%d%d",&n,&m);
    while(scanf("%d",&n)!=EOF)
    {
        ini();
        solve();
        out();
    }
    return 0;
}