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 speed {
  int s, r, no;
};
bool operator<(speed k1, speed k2) {
  if (k1.r != k2.r) return (k1.r > k2.r);
  return (k1.s > k2.s);
}
int main() {
  int n;
  cin >> n;
  vector<speed> a;
  for (int i = 0; i < n; i++) {
    speed x;
    cin >> x.s >> x.r;
    x.no = i + 1;
    a.push_back(x);
  }
  sort(a.begin(), a.end());
  vector<speed> win;
  double key[n + 1];
  key[a[0].no] = (1 << 30);
  win.push_back(a[0]);
  for (int i = 1; i < n; i++) {
    speed x = win[win.size() - 1];
    if (a[i].r == x.r) {
      if (a[i].s == x.s) {
        key[a[i].no] = key[x.no];
        win.push_back(a[i]);
      }
    } else {
      if (a[i].s <= x.s) continue;
      key[a[i].no] =
          double(1.0 / x.s - 1.0 / a[i].s) / double(1.0 / a[i].r - 1.0 / x.r);
      while (key[a[i].no] > key[win[win.size() - 1].no] + 1e-6) {
        win.pop_back();
        speed x = win[win.size() - 1];
        key[a[i].no] =
            double(1.0 / x.s - 1.0 / a[i].s) / double(1.0 / a[i].r - 1.0 / x.r);
      }
      win.push_back(a[i]);
    }
  }
  bool v[n + 1];
  memset(v, 0, sizeof(v));
  for (int i = 0; i < win.size(); i++) {
    v[win[i].no] = 1;
  }
  for (int i = 1; i <= n; i++) {
    if (v[i]) cout << i << " ";
  }
  return 0;
}
