#include <bits/stdc++.h>

 using namespace std;

 const int maxn=+;

 const double eps=1e-;

 int n,top;

 int s[maxn];

 bool mark[maxn];

 struct line{

     double k,b;

     int id;

     bool operator < (const line &a) const{

         if(fabs(a.k-k)<eps) return b<a.b;

         return k<a.k;

     }

 }l[maxn];

 inline double crossx(line x,line y){ return (x.b-y.b)/(y.k-x.k); }

 void insert(int x){

     while(top){

         if(fabs(l[x].k-l[s[top]].k)<eps) top--;

         else if(top>&&crossx(l[x],l[s[top]])<=crossx(l[s[top]],l[s[top-]])) top--;

         else break;

     }

     s[++top]=x;

 }

 void init(){

     scanf("%d",&n);

     for(int i=;i<=n;i++) scanf("%lf%lf",&l[i].k,&l[i].b), l[i].id=i;

     sort(l+,l+n+);

 }

 int main(){

     init();

     for(int i=;i<=n;i++) insert(i);

     for(int i=;i<=top;i++) mark[l[s[i]].id]=true;

     for(int i=;i<=n;i++)if(mark[i]) printf("%d ",i);

     return ;

 }