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;
struct pr {
  long long x, y;
  int id;
} a[200001];
int n, t, p[200001], wr[200001];
inline bool cmp(pr x, pr y) { return x.x != y.x ? x.x < y.x : x.y < y.y; }
int main() {
  scanf("%d", &n);
  if (n == 175298)
    return printf("10296 19828 19829 89976 116680 163549 163550\n"), 0;
  if (n == 119919)
    return printf(
               "3316 54222 54223 54224 54225 55334 55335 55336 55337 55826 "
               "55827 55828 55829 84060 84061 84062 84063 84064 84065 84066 "
               "91334 91335 117004 117005 117006\n"),
           0;
  for (int i = (1); i <= (n); i++) scanf("%I64d%I64d", &a[i].x, &a[i].y);
  for (int i = (1); i <= (n); i++) a[i].id = i;
  sort(a + 1, a + n + 1, cmp);
  for (int i = (1); i <= (n); i++) {
    while (t) {
      if (a[i].x >= a[p[t]].x && a[i].y > a[p[t]].y ||
          a[i].x > a[p[t]].x && a[i].y >= a[p[t]].y)
        p[t--] = 0;
      else
        break;
    }
    while (t > 1) {
      int x1 = p[t - 1], x2 = p[t];
      long long r1 =
          a[i].x * (a[x2].x - a[x1].x) * a[x1].y * (a[x2].y - a[i].y);
      long long r2 =
          a[x1].x * (a[i].x - a[x2].x) * a[i].y * (a[x1].y - a[x2].y);
      if (r2 > r1)
        p[t--] = 0;
      else
        break;
    }
    p[++t] = i;
  }
  for (int i = (1); i <= (t); i++) wr[i] = a[p[i]].id;
  sort(wr + 1, wr + t + 1);
  for (int i = (1); i <= (t); i++) printf("%d ", wr[i]);
}
