#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>

#define int long long
#define double long double
#define fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define mid ((l+r)>>1)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))
#define fan(x) (((x-1)^1)+1)
#define mp(x,y) make_pair(x,y)
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
#define INF 0x3f3f3f3f

using namespace std;

inline int read()
{
	int ans=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){ans=(ans<<1)+(ans<<3)+c-'0';c=getchar();}
	return ans*f;
}

inline void write(int x)
{
	if(x<0) putchar('-'),x=-x;
	if(x/10) write(x/10);
	putchar((char)(x%10)+'0');
}

template<typename T>inline T Abs(T a){return a>0?a:-a;};
template<typename T,typename TT>inline T Min(T a,TT b){return a<b?a:b;}
template<typename T,typename TT> inline T Max(T a,TT b){return a<b?b:a;}

const int N=1e6+5;
int n,del[N];

struct Node
{
	int x,v;
}a[N];

double len(Node p1,Node p2)
{
	if(p1.v==p2.v) return -1;
	return (p2.x-p1.x+0.0)/(p1.v-p2.v);
}

set<pair<int,int> > ps;
priority_queue<pair<double,pair<int,int> > > qu;

inline void delet(int x)
{
	auto it=ps.find(mp(a[x].x,x));del[x]=1;
	if(it==ps.begin()||next(it)==ps.end())
	{
		ps.erase(it);
		return;
	}
	int it1=prev(it)->se,it2=next(it)->se;
	ps.erase(it);
	if(len(a[it1],a[it2])<=0) return;
	qu.push(mp(-len(a[it1],a[it2]),mp(it1,it2)));
}

signed main()
{
	n=read();
	for(int i=1;i<=n;++i)
	{
		a[i].x=read();
		a[i].v=read();
	}
	for(int i=1;i<=n;++i)
		ps.insert(mp(a[i].x,i));
	for(int i=1;i<n;++i)
	{
		double tmp=len(a[i],a[i+1]);
		if(tmp<=0) continue;
		qu.push(mp(-tmp,mp(i,i+1)));
	}
	while(!qu.empty())
	{
		auto U=qu.top();qu.pop();
		int p1=U.se.fi,p2=U.se.se;
		if(del[p1]||del[p2])
			continue;
		delet(p1);delet(p2);
	}
	int res=0;
	for(int i=1;i<=n;++i)
		if(!del[i]) res++;
	write(res);puts("");
	for(int i=1;i<=n;++i)
		if(!del[i]) write(i),putchar(' ');
	return 0;
}