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 read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
const int N = 3e5 + 5;
int n, del[N];
int st[N], top, ok[N];
struct node {
  double l, r;
  int id;
} s[N];
bool cmp(const node &a, const node &b) {
  return a.l == b.l ? a.r > b.r : a.l > b.l;
}
double cacl(node a, node b) {
  return a.l * b.l * (b.r - a.r) / ((b.l - a.l) * a.r * b.r);
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    s[i].l = read();
    s[i].r = read();
    s[i].id = i;
  }
  sort(s + 1, s + n + 1, cmp);
  double maxn = -1e9;
  for (int i = 1; i <= n; i++) {
    if (s[i].r <= maxn)
      del[i] = 1;
    else
      maxn = s[i].r;
  }
  st[++top] = 1;
  for (int i = 2; i <= n; i++) {
    if (del[i]) continue;
    while (top > 1 && cacl(s[i], s[st[top]]) < cacl(s[st[top - 1]], s[st[top]]))
      top--;
    st[++top] = i;
  }
  for (int i = 1; i <= top; i++) {
    ok[s[st[i]].id] = 1;
    int p = st[i] + 1;
    while (p <= n && s[p].l == s[st[i]].l && s[p].r == s[st[i]].r)
      ok[s[p].id] = 1, p++;
  }
  for (int i = 1; i <= n; i++)
    if (ok[i]) printf("%d ", i);
  putchar('\n');
  return 0;
}
