#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=1e5+10;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
typedef pair<int,int> pii;
typedef pair<double,pii> pdp;
#define fi first
#define se second
priority_queue<pdp>q;
int n,v[maxn],x[maxn];
inline void insert(int a,int b){
	if(v[a]<=v[b])return;
	double t=1.*(x[a]-x[b])/(v[a]-v[b]);
	q.push({t,{a,b}});
}
set<int>s;
int main(){
	scanf("%d",&n);
	for(ri i=1;i<=n;++i){
		scanf("%d%d",x+i,v+i);
		s.insert(i);
		if(i>1)insert(i-1,i);
	}
	while(q.size()){
		ri a=q.top().se.fi,b=q.top().se.se;q.pop();
		if(!s.count(a)||!s.count(b))continue;
		s.erase(a),s.erase(b);
		auto l=s.lower_bound(a),r=s.lower_bound(b);
		if(l==s.begin()||r==s.end())continue;
		insert(*--l,*r);
	}
	printf("%d\n",(int)s.size());
	for(ri i:s)printf("%d ",i);
	return 0;
}