#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=5e4+5;
struct line{
    ll a,b,id;
    line operator = (const line &l){
        a=l.a; b=l.b; id=l.id;
    }
};
inline bool cmp(const line &a,const line &b){
    if (a.a!=b.a) return a.a<b.a;
    if (a.b!=b.b) return a.b>b.b;
    return false;
}
inline bool eaq(const line &a,const line &b){
    return a.a==b.a;
}
inline bool check(const line &a,const line &b,const line &c){
    return (a.b-b.b)*a.a+a.b*(b.a-a.a)<=(a.b-b.b)*c.a+c.b*(b.a-a.a);
}
line a[maxn];
int id[maxn];
int main(){
    int i,n,m;
    scanf("%d",&n);
    for (i=0;i<n;i++){
        scanf("%lld%lld",&a[i].a,&a[i].b);
        a[i].id=i+1;
    }
    sort(a,a+n,cmp); n=unique(a,a+n,eaq)-a;
    m=0;
    for (i=0;i<n;i++){
        while (m>1&&check(a[m-2],a[m-1],a[i]))
            m--;
        a[m++]=a[i];
    }
    for (i=0;i<m;i++) id[i]=a[i].id;
    sort(id,id+m);
    for (i=0;i<m;i++) printf("%d ",id[i]);
    return 0;
}