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>
#pragma warning(disable : 4996)
struct LINE {
  double a, b;
  int index;
  bool operator()(LINE p, LINE q) {
    if (p.a < q.a)
      return 1;
    else if (p.a > q.a)
      return 0;
    else
      return p.b > q.b;
  }
} x[500000];
int n;
int stack[500000];
int stacki;
int dab[500000];
int dabi;
int main() {
  int i, j, k;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lf%lf", &x[i].b, &x[i].a);
    x[i].a = -1 / x[i].a;
    x[i].b = -1 / x[i].b;
    x[i].index = i + 1;
  }
  std::sort(x, x + n, LINE());
  stack[stacki++] = 0;
  for (i = 1; i < n; i++) {
    if (x[i].a == x[i - 1].a) continue;
    while (stacki > 0) {
      if ((x[i].a - x[stack[stacki - 1]].a) *
              (x[stack[stacki - 1]].b - x[i].b) <=
          0) {
        stack[--stacki] = 0;
      }
      if (stacki > 1 && (x[stack[stacki - 2]].b - x[stack[stacki - 1]].b) *
                                (x[i].a - x[stack[stacki - 1]].a) >
                            (x[stack[stacki - 2]].a - x[stack[stacki - 1]].a) *
                                (x[i].b - x[stack[stacki - 1]].b)) {
        stack[--stacki] = 0;
      } else
        break;
    }
    if (stacki &&
        (x[i].a - x[stack[stacki - 1]].a) * (x[stack[stacki - 1]].b - x[i].b) <=
            0) {
      stack[--stacki] = 0;
    }
    stack[stacki++] = i;
  }
  for (i = 0; i < stacki; i++) {
    for (j = stack[i]; j < n; j++) {
      if (x[j].a == x[stack[i]].a && x[j].b == x[stack[i]].b)
        dab[dabi++] = x[j].index;
      else
        break;
    }
  }
  std::sort(dab, dab + dabi);
  for (i = 0; i < dabi; i++) printf("%d ", dab[i]);
  return 0;
}
