#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>

using namespace std;

const int maxn=3e5;

int n;
ll X[maxn+5],v[maxn+5]; 
vector<int> ans; 
struct node {
	int x,y; 
	ll p,q; 
	bool operator < (const node &x) const {
		if (x.q==0) return 1;
		if (q==0) return 0; 
		return p*x.q<q*x.p;
	}
} ; 
node make(int x,int y) {
	ll p=(X[y]-X[x]),q=(v[x]-v[y]);
	node ret; 
	ret.x=x,ret.y=y; 
	ret.p=p,ret.q=q;
	return ret;
}
set<node> T; 
int vis[maxn+5],nxt[maxn+5],lst[maxn+5]; 
int main() {
	scanf("%d",&n);
	for (int i=1;i<=n;i++) {
		scanf("%lld %lld",&X[i],&v[i]); 
		if (i!=n) nxt[i]=i+1;
		if (i!=1) lst[i]=i-1;
	}
	for (int i=1;i<n;i++) {
		T.insert(make(i,i+1));
	}
	for (int i=1;i<=n;i++) {
		if (T.size()==0) break ; 
		node t=*T.begin(); 
		if (t.q==0) break ;
		if (t.x>t.y) swap(t.x,t.y); 
		int ls=lst[t.x],nx=nxt[t.y];
		if (ls!=0) nxt[ls]=nx;
		if (nx!=0) lst[nx]=ls;
		if (ls!=0 && nx!=0) T.insert(make(ls,nx));  
		vis[t.x]=vis[t.y]=1; 
	}
	for (int i=1;i<=n;i++) {
		if (!vis[i]) ans.push_back(i); 
	}
	printf("%d\n",ans.size());
	for (auto x:ans) printf("%d ",x); 
 	return 0;
}