UVa Q10131

//UVa Q10131
#include <bits/stdc++.h>
using namespace std;

struct ele{
    int W, Q, idx;
}arr[1001];
bool cmp(ele a, ele b){
    if(a.W == b.W)return a.Q < b.Q;
    else return a.W < b.W;
}
int dp[1001], track[1001];

int32_t main(){
    int n = 1;
    while(cin >> arr[n].W >> arr[n].Q){
        arr[n].idx = n;
        ++n;
    }
    sort(arr+1, arr+n, cmp);
    --n;
    for(int i = 1; i <= n; ++i){
        dp[i] = 1;
        for(int j = 1; j < i; ++j){
            if(arr[i].W > arr[j].W && arr[i].Q < arr[j].Q && dp[i] < dp[j]+1){
                dp[i] = dp[j]+1;
                track[i] = j;
            }
        }
    }
    //for(int i = 1; i <=n; ++i)cout << dp[i] << ' ';
    //cout << endl;
    int x = 1;
    for(int i = 2; i <= n; ++i){
        if(dp[i] > dp[x])x = i;
    }
    cout << dp[x] << '\n';
    vector<int> ans;
    while(x){
        ans.emplace_back(arr[x].idx);
        x = track[x];
    }
    for(int i = ans.size()-1; i >= 0; --i)cout << ans[i] << '\n';
    return 0;
}