#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
typedef long long ll;
int n,bj[100001],pre[100001],suf[100001];
ll x[100001],v[100001];
struct node
{
	int l,r;
	double t;
	node(int ll=0,int rr=0,double tt=0){l=ll;r=rr;t=tt;}
	friend bool operator <(const node &a1,const node &a2){return a1.t>a2.t;}
};
priority_queue<node> q;
void sol()
{
	for(int i=1;i<=n;i++) pre[i]=i-1,suf[i]=i+1;
	for(int i=1;i<n;i++)
	{
		if(v[i]==v[i+1]) continue;
		double curt=(x[i+1]-x[i])*1.0/(v[i]-v[i+1]);
		if(curt<0) continue;
		q.push(node(i,i+1,curt));
	}
	while(!q.empty())
	{
		node now=q.top();q.pop();
		if(bj[now.l]||bj[now.r]) continue;
		bj[now.l]=bj[now.r]=1;
		int l=now.l,r=now.r;
		suf[pre[l]]=suf[r];
		pre[suf[r]]=pre[l];
		if(suf[r]<=n&&pre[l]>=1)
		{
			if(v[pre[l]]==v[suf[r]]) continue;
			double curt=(x[suf[r]]-x[pre[l]])*1.0/(v[pre[l]]-v[suf[r]]);
			if(curt<0) continue;
			q.push(node(pre[l],suf[r],curt));
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>x[i]>>v[i];
	sol();
	int ans=0;
	for(int i=1;i<=n;i++)
		ans+=!bj[i];
	cout<<ans<<endl;
	for(int i=1;i<=n;i++)
		if(!bj[i]) cout<<i<<" ";
	return 0;
}