//什么时候我才能有杜爷一半强啊/kk
#include<cstdio>
#include<queue>
#include<set>
using namespace std;
const int N=100086;
int n,a[N],v[N];
struct infor{
	double t;int x,y;infor(){}
	infor(double tme,int a,int b){t=tme;x=a;y=b;}
	bool operator <(const infor x)const{return t>x.t;}
};
priority_queue<infor>q;
set<int>s;
int read(){
	char ch=getchar();int nn=0,ssss=1;
	while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
	return nn*ssss;
}
bool push(int x,int y){
	if(x<y)x^=y^=x^=y;if(v[x]>=v[y])return false;
	double T=1.0*(a[x]-a[y])/(1.0*(v[y]-v[x]));
	//printf("%d %d %.5lf\n",x,y,T);
	q.push(infor(T,x,y));return true;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i]=read();v[i]=read();
		if(i>1)push(i,i-1);
		s.insert(i);
	}
	while(q.size()&&s.size()){
		infor np=q.top();q.pop();
		if(!(s.count(np.x)&&s.count(np.y)))continue;
		s.erase(np.x);s.erase(np.y);
		if(!s.size())break;
		set<int>::iterator x=s.upper_bound(np.x);
		if(x==s.end())continue;
		set<int>::iterator y=s.lower_bound(np.y);
		if(y==s.begin())continue;y--;
		push(*x,*y);
	}
	printf("%d\n",s.size());
	for(set<int>::iterator it=s.begin();it!=s.end();it++)
		printf("%d ",*it);
}