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

/*
int gcd(int a, int b){
	while(b){
		a %= b;
		swap(a, b);
	}
	return a;
}

struct antseg{
	int gcd = -1;
	int num = 1;

	antseg(){}
	antseg(int n){gcd = n;}
	antseg(int n, int k){gcd = n; num = k;}
};


antseg& operator+(const antseg& lhs, const antseg& rhs){
	if(lhs.gcd == -1) return rhs;
	if(rhs.gcd == -1) return lhs;

	antseg ANT(gcd(lhs.gcd, rhs.gcd), 0);
	if(ANT.gcd == lhs.gcd) ANT.num += lhs.num;
	if(ANT.gcd == rhs.gcd) ANT.num += rhs.num;

	return ANT;
}

antseg& operator=(antseg& lhs, const antseg& rhs){
	lhs.gcd = rhs.gcd;
	lhs.num = rhs.num;

	return rhs;
}
*/


















struct pos{
	int a = 0, b = 0;

	int i = -1;
};

istream& operator>>(istream& in, pos &p){
	in >> p.a >> p.b;
}

bool operator>(const pos& lhs, const pos& rhs){
	if(lhs.a != rhs.a) return lhs.a > rhs.a;
	if(lhs.b != rhs.b) return lhs.b > rhs.b;
	return false;
}

bool operator<(const pos& lhs, const pos& rhs){
	if(lhs.a != rhs.a) return lhs.a < rhs.a;
	if(lhs.b != rhs.b) return lhs.b < rhs.b;
	return false;
}

int main(){
	int n;
	cin >> n;

	vector<set<pos>> last(n+1);
	vector<int> prev(n);
	pos temp;
	last[0].insert(temp);

	temp.a = INT_MAX;
	temp.b = INT_MAX;
	temp.i = -2;

	for(auto &s : last) s.insert(temp);

	int Max = 0;
	int Maxi = -1;

	for(int i = 0; i != n; i++){
		pos curr;
		cin >> curr;
		curr.i = i;

		int a = 0;
		int b = n+1;

		while(a+1 != b){
			int c = (a+b)/2;

			auto iter = lower_bound(last[c].begin(), last[c].end(), curr); iter--;

			if(iter->b < curr.b) a = c;
			else b = c;
		}

		auto iter = lower_bound(last[a].begin(), last[a].end(), curr); iter--;


		prev[i] = iter->i;

		auto nextgr = lower_bound(last[a+1].begin(), last[a+1].end(), curr);

		while(nextgr->b >= curr.b) nextgr = last[a+1].erase(nextgr);

		last[a+1].insert(curr);

		if(a+1 > Max){Max = a+1; Maxi = i;}
	}

	vector<int> out;

	while(Maxi != -1){
		out.push_back(Maxi);
		Maxi = prev[Maxi];
	}

	reverse(out.begin(), out.end());

	printf("%d\n", out.size());
	for(int i : out) printf("%d ", i+1);


	return 0;
}