//#pragma comment(linker, "/STACK:102400000, 102400000")

 #include <algorithm>

 #include <iostream>

 #include <cstdlib>

 #include <cstring>

 #include <cstdio>

 #include <vector>

 #include <cmath>

 #include <ctime>

 #include <list>

 #include <set>

 #include <map>

 using namespace std;

 typedef long long LL;

 typedef pair <int, int> P;

 const int N = ;

 struct Mouse {

     int fat, run, id;

     bool operator <(const Mouse& cmp) const {

         if(fat == cmp.fat)

             return run > cmp.run;

         return fat < cmp.fat;

     }

 }a[N];

 int dp[N];

 int pre[N], ans[N];

 int main()

 {

     int f = ;

     while(scanf("%d %d", &a[f].fat, &a[f].run) != EOF) {

         a[f].id = f;

         f++;

     }

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

         pre[i] = i;

     }

     sort(a + , a + f);

     memset(dp, , sizeof(dp));

     int Max = , pos = ;

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

         dp[i] = ;

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

             if(a[i].fat > a[j].fat && a[i].run < a[j].run) {

                 if(dp[j] +  > dp[i]) {

                     pre[a[i].id] = a[j].id;

                     dp[i] = dp[j] + ;

                 }

             }

         }

         if(dp[i] > Max) {

             pos = a[i].id;

             Max = dp[i];

         }

     }

     printf("%d\n", Max);

     int i = pos, cnt = ;

     for(i = pos; i != pre[i]; i = pre[i]) {

         ans[++cnt] = i;

     }

     ans[++cnt] = i;

     for(i = cnt; i >= ; --i) {

         printf("%d\n", ans[i]);

     }

     return ;

 }