#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	vector<pair<int,int>>arr(n+1);
	for(int i = 1; i<=n; i++){
		cin >> arr[i].first >> arr[i].second;
	}
	set<pair<double,pii>>s;
	set<int>vals;
	for(int i = 1; i<=n; i++){
		vals.insert(i);
	}
	for(int i = 2; i<=n; i++){
		if(arr[i-1].second > arr[i].second){
			int v = (arr[i-1].second - arr[i].second);
			double t = (double)arr[i].first - arr[i-1].first;
			t/=v;
			s.insert({t,{i-1,i}});
		}
	}
	while(s.size()){
		auto res = *s.begin();
		s.erase(s.begin());
		int x = res.second.first;
		int y = res.second.second;
		if(vals.find(x) == vals.end() || vals.find(y) == vals.end()){
			continue;
		}
		vals.erase(x);
		vals.erase(y);
		auto l = vals.lower_bound(x);
		if(l==vals.begin())continue;
		l--;
		auto r = vals.upper_bound(y);
		if(r==vals.end())continue;
		int lx = *l;
		int rx = *r;
		if(arr[lx].second > arr[rx].second){
			int v = (arr[lx].second - arr[rx].second);
			double t = double(arr[rx].first - arr[lx].first);
			t/=v;
			s.insert({t,{lx,rx}});
		}
	}
	cout << vals.size() << '\n';
	vector<int>vec;
	for(int nxt: vals){
		vec.push_back(nxt);
	}
	for(int i = 0; i<vec.size(); i++){
		cout << vec[i];
		if(i+1<vec.size())cout << ' ';
	}
	cout << '\n';
	return 0;
}