#include<set>

#include<map>

#include<stack>

#include<queue>

#include<cmath>

#include<cstdio>

#include<cctype>

#include<string>

#include<vector>

#include<climits>

#include<cstring>

#include<cstdlib>

#include<iostream>

#include<algorithm>

#define max(a, b) (a > b ? a : b)

#define min(a, b) (a < b ? a : b)

#define mst(a) memset(a, 0, sizeof(a))

#define _test printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n")

using namespace std;

typedef long long ll;

typedef pair<int, int> P;

const double eps = 1e-;

const int INF = 0x3f3f3f3f;

const ll ll_INF = 0x3f3f3f3f3f3f3f;

const int maxn = 1e3+;

struct tt{

    int num, a, b;

}_num[maxn];

bool cmp(tt a1, tt a2) {

    if (a1.b == a2.b)

        return a1.a > a2.a;

    return a1.b > a2.b;

}

bool cmp2(tt a1, tt a2) {

    return a1.num < a2.num;

}

int main(void) {

    int n;

    scanf("%d", &n);

    for (int i = ; i<=n; ++i) {

        scanf("%d%d", &_num[i].a, &_num[i].b);

        _num[i].num = i;

    }

    sort(_num+, _num+n+, cmp); //按上传时间的大小排序

    int temp = _num[].a; //用最后一个数据的下载时间做判断

    for (int i = ; i<=n; ++i) {

        if (_num[i].b > temp) //这个数据的上传时间晚于上一个数据的下载时间，所以会被覆盖

            _num[i].num = ;

        else

            temp = _num[i].a; //不会被覆盖，再用此数据的下载时间判断之后的数据

    }

    sort(_num+, _num+n+, cmp2);  //按序号的大小排序

    for (int i = ; i<=n; ++i)

        if (_num[i].num)

            printf("%d ", _num[i].num);

    return ;

}