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;
struct q {
  int s, r, d;
} a[200009];
bool cmp(q a, q b) {
  if (a.s == b.s) return a.r > b.r;
  return a.s < b.s;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &a[i].s, &a[i].r), a[i].d = i;
  sort(a, a + n, cmp);
  vector<bool> v(n, 0);
  vector<int> st(n);
  int t = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0 && a[i].s == a[i - 1].s) continue;
    while (t > 1 && 1ll * a[i].s * a[st[t - 2]].r * (a[st[t - 1]].r - a[i].r) *
                            (a[st[t - 1]].s - a[st[t - 2]].s) <
                        1ll * a[i].r * a[st[t - 2]].s *
                            (a[st[t - 1]].s - a[i].s) *
                            (a[st[t - 1]].r - a[st[t - 2]].r))
      t--;
    st[t++] = i;
  }
  for (int i = 0; i < t; i++) v[a[st[i]].d] = 1;
  for (int i = 0; i < t - 1; i++)
    if (a[st[i]].r <= a[st[i + 1]].r)
      v[a[st[i]].d] = 0;
    else
      break;
  for (int i = 1; i < n; i++)
    if (v[a[i - 1].d] && a[i].s == a[i - 1].s && a[i].r == a[i - 1].r)
      v[a[i].d] = 1;
  for (int i = 0; i < n; i++)
    if (v[i]) printf("%d ", i + 1);
  printf("\n");
  return 0;
}
