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;
const int Maxn = 2e5 + 5;
class line {
 public:
  int x, y;
  int id;
  bool operator<(const line &o) const {
    return x < o.x || (x == o.x && y < o.y);
  }
};
class lineset {
 public:
  int x, y;
  vector<int> ids;
};
int n;
vector<int> hull;
vector<lineset> ls;
line l[Maxn];
bool pw[Maxn];
bool check(int id1, int id2, int id3) {
  long long d = (long long)ls[id2].y * ls[id3].x * (ls[id2].x - ls[id1].x) *
                    (ls[id3].y - ls[id1].y) -
                (long long)ls[id2].x * ls[id3].y * (ls[id2].y - ls[id1].y) *
                    (ls[id3].x - ls[id1].x);
  return d > 0;
}
void insert(int id) {
  int m = hull.size() - 1;
  while (m >= 0) {
    if (ls[hull[m]].y <= ls[id].y) {
      hull.pop_back();
      m--;
    } else
      break;
  }
  int l = m - 1;
  while (m > 0) {
    if (check(hull[l], hull[m], id)) {
      hull.pop_back();
      m--;
      l--;
    } else
      break;
  }
  hull.push_back(id);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &l[i].x, &l[i].y);
    l[i].id = i;
  }
  sort(l + 1, l + n + 1);
  int it = -1;
  for (int i = 1; i <= n; i++) {
    if (l[i - 1].x == l[i].x && l[i - 1].y == l[i].y) {
      ls[it].ids.push_back(l[i].id);
    } else {
      lineset nls;
      nls.x = l[i].x;
      nls.y = l[i].y;
      nls.ids.push_back(l[i].id);
      ls.push_back(nls);
      it++;
    }
  }
  for (int i = 0; i <= it; i++) insert(i);
  for (auto v : hull) {
    for (auto p : ls[v].ids) {
      pw[p] = true;
    }
  }
  for (int i = 1; i <= n; i++)
    if (pw[i]) printf("%d ", i);
  return 0;
}
