#include<iostream>
#include<array>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;

vector<set<array<int, 3>>> lis;
vector<int> parent;

bool query(array<int, 3> a, int x){
    array<int, 3> s = {a[0], -1, -1};
    auto it = lower_bound(lis[x].begin(), lis[x].end(), s);
    if(it != lis[x].begin()) it--;
    return a[1] > (*it)[1];
}

int idquery(array<int, 3> a, int x){
    if(x == 0) return -1;
    array<int, 3> s = {a[0], -1, -1};
    auto it = lower_bound(lis[x].begin(), lis[x].end(), s);
    if(it != lis[x].begin()) it--;
    return (*it)[2];
}

void add(array<int, 3> a, int x){
    lis[x].insert(a);
    auto it = upper_bound(lis[x].begin(), lis[x].end(), a);
    while(it != lis[x].end()){
        it = lis[x].erase(it);
    }
}

int main(){
    int n;
    cin >> n;
    lis.push_back({{0, 0, 0}});
    parent.resize(n);
    for(int i = 0; i < n; i++){
        array<int, 3> a;
        cin >> a[0] >> a[1];
        a[2] = i;
        int lo = 0, hi = lis.size(), mid;
        while(lo + 1 < hi){
            mid = (lo + hi) / 2;
            if(query(a, mid)) lo = mid;
            else hi = mid;
        }
        parent[i] = idquery(a, lo);
        if(lo + 1 == lis.size()){
            lis.push_back({a});
        }
        else add(a, lo + 1);
    }
    cout << lis.size() - 1 << "\n";
    int m = (*lis[lis.size() - 1].begin())[2];
    vector<int> ans;
    while(m != -1){
        ans.push_back(m + 1);
        m = parent[m];
    }
    reverse(ans.begin(), ans.end());
    for(auto x : ans) cout << x << " ";
}