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;
int n;
struct node {
  int s, r, no;
} xx[500001], dance[500001], fire[500001];
bool cmp(node x, node y) { return x.s > y.s || (x.s == y.s && x.r > y.r); }
int S[500001];
int ans[500001];
int mal = 0;
int k;
int q;
bool yes[500001];
double eps = 1e-6;
int h, t;
int X[10001];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &xx[i].s, &xx[i].r);
  for (int i = 1; i <= n; i++) xx[i].no = i;
  sort(xx + 1, xx + n + 1, cmp);
  for (int i = 1; i <= n; i++) {
    if (mal > xx[i].r) continue;
    if (mal == xx[i].r && q == xx[i].s) {
      dance[++k] = xx[i];
      continue;
    }
    if (q == xx[i].s) continue;
    if (mal == xx[i].r) continue;
    {
      dance[++k] = xx[i];
      mal = xx[i].r;
      q = xx[i].s;
    }
  }
  h = 1;
  fire[++t] = dance[1];
  for (int i = 2; i <= k; i++) {
    if (h <= t && dance[i].r <= fire[t].r) continue;
    while (h < t) {
      long long s1 = fire[t - 1].s, s2 = fire[t].s, r1 = fire[t - 1].r,
                r2 = fire[t].r;
      long long s3 = dance[i].s, r3 = dance[i].r;
      long long k1 = (s3 - s2) * (r1 - r2) * r3 * s1;
      long long k2 = (s1 - s2) * (r3 - r2) * r1 * s3;
      if (k1 < k2)
        t--;
      else
        break;
    }
    fire[++t] = dance[i];
  }
  int xxx = 0;
  for (int i = 1; i <= t; i++) {
    X[fire[i].s] = fire[i].r;
  }
  for (int i = 1; i <= n; i++) {
    if (X[xx[i].s] == xx[i].r) ans[++xxx] = xx[i].no;
  }
  sort(ans + 1, ans + xxx + 1);
  for (int i = 1; i <= xxx; i++) cout << ans[i] << " ";
}
