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

/*<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 = 100005;

inline int read(void){
	char opt;int flag=1,res=0;
	while((opt=getchar())<'0')if(opt=='-')flag=-1;
	while(opt>='0'){res=(res<<3)+(res<<1)+opt-'0';opt=getchar();}
	return res*flag;
}

int prv[N];
vector<int> vals1, vals2;
ar<int,2> p[N]; 
unordered_map<int, ar<int,2>> fen[N];

ar<int,2> get(int x, int y){
	ar<int,2> ans = {0,0};
	for(int i = x; i >= 1; i-=i&-i){
		for(int j = y; j >= 1; j-=j&-j) ans = max(ans, fen[i][j]);
	}
	return ans;
}

void mod(int x, int y, ar<int,2> v){
	for(int i = x; i < N; i+= i&-i){
		for(int j = y; j < N; j += j & -j) fen[i][j] = max(fen[i][j], v);
	}
	return;
}

int value1(int x){
	return lower_bound(vals1.begin(), vals1.end(), x) - vals1.begin() + 1;	
}
int value2(int x){
	return lower_bound(vals2.begin(), vals2.end(), x) - vals2.begin() + 1;	
}

int main()
{
	FAST;
	int n = read();

	ar<int,2> ans = {0,0};
	for(int i = 1; i <= n; ++i){
		p[i][0] = read();
		p[i][1] = read();
		vals1.pb(p[i][0]);
		vals2.pb(p[i][1]);
	}

	sort(vals1.begin(), vals1.end());
	vals1.erase(unique(vals1.begin(), vals1.end()), vals1.end());

	sort(vals2.begin(), vals2.end());
	vals2.erase(unique(vals2.begin(), vals2.end()), vals2.end());
	
	for(int i = 1; i <= n; ++i){
		int x = value1(p[i][0]), y = value2(p[i][1]);

		ar<int,2> cur = get(x-1, y-1);
		prv[i] = cur[1];

		++cur[0];
		cur[1] = i;

		ans = max(ans, cur);

		mod(x,y,cur);
	}

	printf("%d\n", ans[0]);
	int cur = ans[1];
	vector<int> res;
	while(cur){
		res.pb(cur);
		cur = prv[cur];
	}
	for(int i = res.size()-1; i >= 0; --i) printf("%d ", res[i]);
	puts("");
	return 0;
}