#include <set>#include <map>#include <queue>#include <stack>#include <cmath>#include <cstdio>#include <cstdlib>#include <iostream>#include <climits>#include <cstring>#include <string>#include <algorithm>#define MId(x,y) ( ( x + y ) >> 1 )#define L(x) ( x << 1 )#define R(x) ( x << 1 | 1 )#define FOR(i,s,t) for(int i=(s); i<(t); i++)using namespace std;const int MAX = 1010;struct NODE{int x, y, id;bool operator<(const NODE& a) const {if( a.x == x )return y < a.y;return x < a.x;}};NODE a[MAX];int m[MAX];int pre[MAX];void solve(int n) {sort(a, a+n);m[0] = 1;pre[0] = -1;FOR(i, 1, n) {int mm = 0;int t = -1;FOR(k, 0, i) {if( a[i].x > a[k].y ) {mm = m[k];t = k;}}m[i] = mm + 1;pre[i] = t;}int out[MAX], cnt = 0;int maxl = *max_element(m, m+n);for(int i=n-1; i>=0; i--)if( m[i] == maxl ) {while( i != -1 ) {out[cnt++] = a[i].id;i = pre[i];}break;}for(int i=cnt-1; i>0; i--)cout << out[i] << ' ';cout << out[0] << endl;}int main(){int n;while( cin >> n && n ) {FOR(i, 0, n) {cin >> a[i].x >> a[i].y;a[i].id = i + 1;}solve( n );}return 0;}
