#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=(int)1e5+5;
int n,cnt,st,L[maxn],R[maxn],vis[maxn],x[maxn],v[maxn];
inline double calc(int a,int b){if(x[a]>x[b])swap(a,b);return v[a]>v[b] ? (double)(x[b]-x[a])/(double)(v[a]-v[b]) : -1;}
inline void del(int a){
	if(st==a) st=R[a];
	if(R[a]) L[R[a]]=L[a]; if(L[a]) R[L[a]]=R[a]; L[a]=R[a]=0;
}
struct Node{int x,y;double t;bool operator <(const Node&q)const{return t==q.t?x==q.x?y<q.y:x<q.x:t>q.t;}};
priority_queue<Node> q;
signed main(){
	scanf("%lld",&n); cnt=n;
	for(int al=1;al<=n;al++) scanf("%lld%lld",&x[al],&v[al]);
	st=1;for(int al=1;al<n;al++)R[al]=al+1;for(int al=2;al<=n;al++)L[al]=al-1;
	for(int al=1;al<n;al++){
		double t=calc(al,al+1);
		if(t>0) q.push((Node){al,al+1,t});
	}
	while(!q.empty()){
		Node h=q.top(); q.pop(); if(vis[h.x] || vis[h.y])continue;
		vis[h.x] = vis[h.y] = 1;
		int pre=L[h.x], nxt=R[h.y]; del(h.x), del(h.y); cnt-=2;
		if(pre && nxt){
			double t=calc(pre,nxt);
			if(t>0) q.push((Node){pre,nxt,t});
		}
	}
	printf("%lld\n",cnt);
	for(int al=1;al<=n;al++)if(!vis[al]) printf("%lld ",al);
	return 0;
}