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 ok[200005], n, q[200005], s[200005];
struct data {
  int id, a, b;
} c[200005];
bool cmp(data a, data b) {
  if (a.a == b.a) return a.b > b.b;
  return a.a > b.a;
}
int Judge(data a, data b, data c) {
  long long k = 1LL * (b.a - a.a) * (c.a - b.a);
  if (k < 0)
    k = -1;
  else
    k = 1;
  return 1LL * (a.b - b.b) * a.a * c.b * (c.a - a.a) * k >
         1LL * k * (b.b - c.b) * c.a * a.b * (b.a - a.a);
}
int interisminus(data a, data b) {
  int x = 1, y = 1;
  if (a.b < b.b) x = -1;
  if (a.b == b.b) x = 0;
  if (b.a < a.a) y = -1;
  if (x * y != 1) return 1;
  return 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &c[i].a, &c[i].b), c[i].id = i;
  sort(c + 1, c + 1 + n, cmp);
  int r = 0;
  c[0].a = -1;
  for (int i = 1; i <= n; i++) {
    if (c[i].a == c[i - 1].a) continue;
    while (r > 1 && Judge(c[i], c[q[r]], c[q[r - 1]])) r--;
    q[++r] = i;
  }
  for (int i = 1; i <= r; i++) ok[c[q[i]].id] = 1;
  for (int i = r; i > 1; i--) {
    if (c[q[i]].b <= c[q[i - 1]].b)
      ok[c[q[i]].id] = 0;
    else
      break;
  }
  for (int i = 2; i <= n; i++)
    if (c[i].a == c[i - 1].a && c[i].b == c[i - 1].b && ok[c[i - 1].id])
      ok[c[i].id] = 1;
  for (int i = 1; i <= n; i++)
    if (ok[i]) printf("%d ", i);
  printf("\n");
  return 0;
}
