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

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

void add(array<int, 3> a, set<array<int, 3>>& s){
    s.insert(a);
    auto it = s.upper_bound(a);
    while(it != s.end()){
        if((*it)[1] >= a[1]) it = s.erase(it);
        else break;
    }
}

bool check(array<int, 3> a, set<array<int, 3>>& s){
    auto it = s.lower_bound({a[0] + 1, -1});
    if(it == s.begin()) return false;
    it--;
    return ((*it)[1] < a[1]);
}

int index(array<int, 3> a, set<array<int, 3>>& s){
    auto it = s.upper_bound({a[0], -1, -1});
    it--;
    return (*it)[2];
}

void solve(array<int, 3> a){
    int lo = -1, hi = lis.size(), mid;
    while(lo + 1 < hi){
        mid = (lo + hi) / 2;
        if(check(a, lis[mid])) lo = mid;
        else hi = mid;
    }
    if(lo + 1 >= lis.size()) lis.push_back({});
    add(a, lis[lo + 1]);
    if(lo != -1) p[a[2]] = index(a, lis[lo]);
}


int main() {
    int n;
    cin >> n;
    lis = {{{0, 0, 0}}};
    p.resize(n + 1);
    for(int i = 0; i < n; i++){
        array<int, 3> a;
        cin >> a[0] >> a[1];
        a[2] = i + 1;
        solve(a);
    }
    cout << lis.size() - 1 << "\n";
    int c = (*lis.back().begin())[2];
    vector<int> ans;
    while(c != 0){
        ans.push_back(c);
        c = p[c];
    }
    reverse(ans.begin(), ans.end());
    for(auto x : ans) cout << x << " ";
}