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;
const int MOD = 1000000007;
const int INF = 2e9;
const long long INFLL = 1e18;
const int MAX_N = 1;
struct S {
  long long x, y;
  int idx;
  bool operator<(const S &a) const {
    if (x == a.x) {
      return y < a.y;
    }
    return x > a.x;
  }
};
vector<S> vt;
int N;
vector<int> v;
bool ccw(S a, S b, S c) {
  long long s = 0;
  s = (a.x * b.x - b.x * c.x) * (a.y * c.y - b.y * c.y);
  s -= (a.x * c.x - b.x * c.x) * (a.y * b.y - b.y * c.y);
  return s >= 0;
}
vector<int> ans;
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    long long a, b;
    scanf("%lld%lld", &a, &b);
    vt.push_back({a, b, i + 1});
  }
  sort(vt.begin(), vt.end());
  v.push_back(0);
  long long my = vt[0].y;
  for (int i = 1; i < N; i++) {
    while (v.size() > 1) {
      if (ccw(vt[v[v.size() - 2]], vt[v[v.size() - 1]], vt[i])) {
        v.pop_back();
      } else {
        break;
      }
    }
    while (!v.empty() && vt[v.back()].x == vt[i].x &&
           vt[v.back()].y != vt[i].y) {
      v.pop_back();
    }
    if (vt[i].y > my || (vt[i].y == my && vt[i].x == vt[v.back()].x)) {
      my = vt[i].y;
      v.push_back(i);
    }
  }
  for (int i = 0; i < v.size(); i++) {
    ans.push_back(vt[v[i]].idx);
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) {
    printf("%d ", ans[i]);
  }
  return 0;
}
