#include<bits/stdc++.h>
#define pii pair<db,pair<int,int>>
#define fi first
#define se second
#define eps 1e-9
#define db long double
#define equals(a,b) fabs(a-b) < eps
using namespace std;

typedef long long ll;


//d * n = s * k + remain

inline ll rd(){
	ll x;
	scanf("%lld",&x);
	return x;
}

const int maxn = 1e5 + 5;

int x[maxn],v[maxn];
priority_queue<pii> Q;

void add(int p,int q){
	if(v[p] <= v[q]) return;
	db T = (db)(x[p] - x[q]) / (db)(v[p] - v[q]); 
	Q.push(make_pair(T,make_pair(p,q)));
}


int main(){
	set<int> s;
	int n = rd();
	for(int i = 1;i <= n;i++){
		x[i] = rd();
		v[i] = rd();
		s.insert(i);
	}
	for(int i = 1;i < n;i++)
		add(i,i + 1);
	while(!Q.empty() && s.size()){
		auto P = Q.top().se;
		int i = P.fi;
		int j = P.se;
		Q.pop();
		if(!s.count(j) || !s.count(i)) continue;
		s.erase(i);
		s.erase(j);
		if(!s.size()) break;
		auto it = s.lower_bound(i);
		if(it == s.end() || it == s.begin()) continue;
		int pre = *(--it);
		int nxt = *s.lower_bound(j);
		add(pre,nxt);
	}
	printf("%d\n",s.size());
	for(auto it:s){
		cout << it << '\n';
	}
return 0;
}