Tavas is a cheerleader in the new sports competition named "Pashmaks".

<image>

This competition consists of two part: swimming and then running. People will immediately start running R meters after they finished swimming exactly S meters. A winner is a such person that nobody else finishes running before him/her (there may be more than one winner).

Before the match starts, Tavas knows that there are n competitors registered for the match. Also, he knows that i-th person's swimming speed is si meters per second and his/her running speed is ri meters per second. Unfortunately, he doesn't know the values of R and S, but he knows that they are real numbers greater than 0.

As a cheerleader, Tavas wants to know who to cheer up. So, he wants to know all people that might win. We consider a competitor might win if and only if there are some values of R and S such that with these values, (s)he will be a winner.

Tavas isn't really familiar with programming, so he asked you to help him.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 2 × 105).

The next n lines contain the details of competitors. i-th line contains two integers si and ri (1 ≤ si, ri ≤ 104).

Output

In the first and the only line of output, print a sequence of numbers of possible winners in increasing order.

Examples

Input

3
1 3
2 2
3 1


Output

1 2 3 


Input

3
1 2
1 1
2 1


Output

1 3 
5
10 50
10 50
10 50
10 50
10 50
 2
10000 10000
10000 10000
 3
10000 10000
10000 10000
10000 10000
 3
1000 3000
1500 1500
3000 1000
 43
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 1
1 1
 2
1 1
1 1
 44
78 52
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 3
1000 3000
1499 1499
3000 1000
 5
50 50
49 50
50 49
49 49
50 1
 18
82 38
33 69
33 69
33 69
33 69
33 69
82 38
33 69
33 69
33 69
82 38
33 69
33 69
82 38
82 38
33 69
33 69
33 69
 1
10000 9999
 3
1000 3000
1501 1501
3000 1000
 2
1 2
2 1

1 2 3 4 5
 1 2
 1 2 3
 1 2 3
 1 3 16 24 29 31 32 37 41 42
 1
 1 2
 1
 1 3
 1
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 1
 1 2 3
 1 2 

#include <bits\stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 200005;
#define y1 vjsdlkcfm
int n;
bool used[N];
map<pair<int, int>, vector<int> > mp;
struct point{
    double x, y;
    ll xx, yy;
};
bool cmp(point a, point b){
    return (a.xx > b.xx || (a.xx == b.xx && a.yy < b.yy));
}
bool chk(point a, point b, point c){
    ll res = a.yy * b.xx * c.xx * (c.yy - b.yy) + b.yy * a.xx * c.xx * (a.yy - c.yy) + c.yy * a.xx * b.xx * (b.yy - a.yy);
    //return 0;
    return res == 0;
}
bool cw(point a, point b, point c){
    ll res = a.yy * b.xx * c.xx * (c.yy - b.yy) + b.yy * a.xx * c.xx * (a.yy - c.yy) + c.yy * a.xx * b.xx * (b.yy - a.yy);
    return res <= 0;
}
bool ccw(point a, point b, point c){
    ll res = a.yy * b.xx * c.xx * (c.yy - b.yy) + b.yy * a.xx * c.xx * (a.yy - c.yy) + c.yy * a.xx * b.xx * (b.yy - a.yy);
    return res >= 0;
}
void convex_hull(vector<point> & a){
    if(a.size() == 1) return;
    sort(a.begin(), a.end(), &cmp);
    point p1 = a[0];
    point p2 = a.back();
    vector<point> up;
    vector<point> down;
    up.push_back(p1);
    down.push_back(p1);
    for(int i = 1; i < a.size(); ++i){
        int flag = 0;
        if(i == a.size() - 1 || ccw(p1, a[i], p2)){
            if(chk(p1, a[i], p2) && i != a.size() - 1) flag = 1;
            while(down.size() > 1 && !ccw(down[down.size() - 2], down[down.size() - 1], a[i]))
                down.pop_back();
            down.push_back(a[i]);
        }
        if(i == a.size() - 1 || cw(p1, a[i], p2) && !flag){
            while(up.size() > 1 && !cw(up[up.size() - 2], up[up.size() - 1], a[i]))
                up.pop_back();
            up.push_back(a[i]);
        }
    }
    a.clear();
    for(int i = 0; i < (int)up.size(); ++i){
        a.push_back(up[i]);
    }
    for(int i = down.size() - 2; i > 0; --i){
        a.push_back(down[i]);
    }
    return;
}
vector<point> a;
vector<pair<pair<int, int>, int> >tmp;
int main(){
    cin >> n;
    for(int i = 0; i < n; ++i){
        int x, y;
        scanf("%d %d", &x, &y);
        point cur;
        cur.x = 1. / x;
        cur.y = 1. / y;
        cur.xx = x;
        cur.yy = y;
        a.push_back(cur);
        mp[make_pair(x, y)].push_back(i + 1);
        tmp.push_back(make_pair(make_pair(x, y), i + 1));
    }
    sort(tmp.begin(), tmp.end());
    int mx = 0;
    for(int i = n - 1; i >= 0; --i){
        mx = max(tmp[i].first.second, mx);
        if(tmp[i].first.second < mx){
            used[tmp[i].second] = 1;
        }
        swap(tmp[i].first.first, tmp[i].first.second);
    }
    sort(tmp.begin(), tmp.end());
    mx = 0;
    for(int i = n - 1; i >= 0; --i){
        mx = max(tmp[i].first.second, mx);
        if(tmp[i].first.second < mx){
            used[tmp[i].second] = 1;
        }
        swap(tmp[i].first.first, tmp[i].first.second);
    }
    convex_hull(a);
    //for(int i = 0; i < (int)a.size(); ++i){ cout << a[i].x << " " << a[i].y << endl; }
    point mx_h;
    mx_h.x = 1e9;
    mx_h.y = -1e9;
    point mx_r;
    mx_r.x = -1e9;
    mx_r.y = 1e9;
    for(int i = 0; i < (int)a.size(); ++i){
        point it = a[i];
        if(mx_h.x > it.x || (mx_h.x == it.x && mx_h.y < it.y)){
            mx_h.x = it.x;
            mx_h.y = it.y;
        }
        if(mx_r.x < it.x || (mx_r.x == it.x && mx_r.y > it.y)){
            mx_r.x = it.x;
            mx_r.y = it.y;
        }
    }
    swap(mx_h.x, mx_r.x);
    swap(mx_h.y, mx_r.y);
    //cout << mx_h.x << " " << mx_h.y << endl;
    //cout << mx_r.x << " " << mx_r.y << endl;
    int ln = a.size();
    for(int i = 0; i < ln; ++i){
        a.push_back(a[i]);
    }
    int ind = -1;
    for(int i = 0; i < ln; ++i){
        if(a[i].x == mx_h.x && a[i].y == mx_h.y){
            ind = i;
            break;
        }
    }
    int dop_ind = ind + ln - 1;
    while(a[dop_ind].x != mx_r.x || a[dop_ind].y != mx_r.y){
        dop_ind--;
    }
    //cout << ind << " " << dop_ind << endl;
    vector<int> ans;
    for(int i = ind; i <= dop_ind; ++i){
        point it = a[i];
        int x = 1. / it.x + 1e-12;
        int y = 1. / it.y + 1e-12;
        vector<int> cur = mp[make_pair(x, y)];
        mp[make_pair(x, y)].clear();
        for(auto xx : cur){
            ans.push_back(xx);
        }
    }
    sort(ans.begin(), ans.end());
    for(auto it : ans){
        if(!used[it])
        cout << it << " ";
    }
    return 0;
}
