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 
#include <bits/stdc++.h>
using namespace std;
int n, st[310000], to[310000], v[310000];
struct node {
  double a, b;
  int id;
} w[310000];
char cmp1(node x, node y) { return (x.a > y.a) || (x.a == y.a && x.b > y.b); }
char cmp2(node x, node y) { return (x.b > y.b) || (x.b == y.b && x.a > y.a); }
char cmp3(node x, node y) { return (x.a > y.a) || (x.a == y.a && x.b > y.b); }
double cal(int x, int y) {
  return w[x].a / w[x].b * w[y].a / w[y].b * (w[x].b - w[y].b) /
         (w[x].a - w[y].a);
}
int main() {
  scanf("%d", &n);
  for (register int i = 1; i <= n; i++)
    scanf("%lf%lf", &w[i].a, &w[i].b), w[i].id = i;
  sort(w + 1, w + n + 1, cmp1);
  double maxn = 0;
  for (register int i = 1; i <= n; i++) {
    if (w[i].b < maxn) v[w[i].id] = 1;
    maxn = max(maxn, w[i].b);
  }
  sort(w + 1, w + n + 1, cmp2);
  maxn = 0;
  for (register int i = 1; i <= n; i++) {
    if (w[i].a < maxn) v[w[i].id] = 1;
    maxn = max(maxn, w[i].a);
  }
  int num = 0;
  for (register int i = 1; i <= n; i++) {
    if (!v[w[i].id]) {
      ++num;
      w[num].a = w[i].a, w[num].b = w[i].b;
      w[num].id = w[i].id;
    }
  }
  n = num;
  sort(w + 1, w + n + 1, cmp3);
  num = 0;
  for (register int i = 1; i <= n; i++) {
    if (w[i].a == w[i - 1].a && w[i].b == w[i - 1].b) {
      to[w[i - 1].id] = w[i].id;
    } else {
      w[++num].a = w[i].a, w[num].b = w[i].b;
      w[num].id = w[i].id;
    }
  }
  n = num;
  sort(w + 1, w + n + 1, cmp3);
  st[++st[0]] = 1;
  for (register int i = 2; i <= n; i++) {
    if (cal(st[st[0]], i) > 0) continue;
    while (st[0] > 1 &&
           cal(st[st[0] - 1], st[st[0]]) - cal(st[st[0]], i) > 1e-10)
      st[0]--;
    st[++st[0]] = i;
  }
  num = st[0];
  for (register int i = 1; i <= st[0]; i++) {
    st[i] = w[st[i]].id;
    for (register int j = to[st[i]]; j; j = to[j]) st[++num] = j;
  }
  st[0] = num;
  sort(st + 1, st + st[0] + 1);
  for (register int i = 1; i <= st[0]; i++) printf("%d ", st[i]);
}
