#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 200005;


struct point{
	int x, y, id;
	bool operator<(const point& o) const{
		return x < o.x;
	}
};

int n, p[N];
set<point> last[N];

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

	last[0].insert({0,0,0});
	int totmx=0, mxpos;

	for(int i = 1; i <= n; ++i){
		int x, y; cin >> x >> y;
		int mx = 0, cprv=0;

		for(int j = 17; j >= 0; --j){
			int nmx = mx + (1<<j);

			auto it = last[nmx].lower_bound({x,y,-1});

			if(it != last[nmx].begin()){
				--it;
				if(it->y >= y) continue;
				mx = nmx;
				p[i] = it->id;
			}
		}

		++mx;

		auto it = last[mx].lower_bound({x,y,-1});	

		while(it != last[mx].end() && it->y >= y) it = last[mx].erase(it);

		if(it == last[mx].end() || it->x != x) last[mx].insert({x,y,i});

		if(mx > totmx){
			totmx = mx;
			mxpos = i;
		}
	}

	cout << totmx << '\n';
	vector<int> res;
	int cur = mxpos;
	while(cur){
		res.pb(cur);
		cur = p[cur];
	}
	for(int i = res.size()-1; i >=0; --i) cout <<res[i] << ' ';
	cout << '\n';
	
	return 0;
}