#include <bits/stdc++.h>
using namespace std;
int n;
vector< pair<double,int> > vec;
bool compare(pair<double,int> a, pair<double,int> b) {
    return a.first > b.first;
}
int main() {
    scanf("%d",&n);
    for (int i=1; i<=n; ++i) {
        int a,b;
        scanf("%d %d",&a,&b);
        vec.push_back({(double)a/(a+b), i});
    }
    sort(vec.begin(),vec.end(),compare);
    for (auto a:vec) {
        printf("%d ",a.second);
    }
    return 0;
}

一半没过