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 double eps = 1e-15;
const int N = 200005;
struct Node {
  double x, y;
  int id;
  Node() {}
  Node(double x, double y, int id) : x(x), y(y), id(id) {}
  bool operator<(const Node &a) const { return x < a.x; }
  bool operator==(const Node &a) const {
    return fabs(x - a.x) < eps && fabs(y - a.y) < eps;
  }
};
Node nd[N];
int Stack[N], scnt;
int Equal[N], ecnt;
double gety(int i, int j) { return nd[i].y - nd[j].y; }
double getx(int i, int j) { return nd[i].x - nd[j].x; }
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  if (x > 0) return 1;
  return -1;
}
vector<int> res;
int main() {
  int n, x, y;
  while (~scanf("%d", &n)) {
    for (int i = 1; i <= n; i++) {
      scanf("%d%d", &x, &y);
      nd[i] = Node(1.0 / x, 1.0 / y, i);
    }
    sort(nd + 1, nd + n + 1);
    scnt = ecnt = 0;
    for (int i = 1; i <= n; i++) {
      if (scnt == 0)
        Stack[scnt++] = i;
      else if (scnt && nd[Stack[scnt - 1]] == nd[i])
        Equal[ecnt++] = i;
      else {
        if (scnt && sgn(nd[i].y - nd[Stack[scnt - 1]].y) >= 0) continue;
        while (scnt && sgn(nd[i].x - nd[Stack[scnt - 1]].x) == 0 &&
               sgn(nd[i].y - nd[Stack[scnt - 1]].y) < 0) {
          scnt--;
          while (ecnt && nd[Stack[scnt]] == nd[Equal[ecnt - 1]]) ecnt--;
        }
        while (scnt >= 2) {
          double dx1 = getx(i, Stack[scnt - 1]);
          double dy1 = gety(i, Stack[scnt - 1]);
          double dx2 = getx(Stack[scnt - 1], Stack[scnt - 2]);
          double dy2 = gety(Stack[scnt - 1], Stack[scnt - 2]);
          if (dy2 * dx1 > dy1 * dx2) {
            scnt--;
            while (ecnt && nd[Stack[scnt]] == nd[Equal[ecnt - 1]]) ecnt--;
          } else
            break;
        }
        Stack[scnt++] = i;
      }
    }
    res.clear();
    for (int i = 0; i < scnt; i++) res.push_back(nd[Stack[i]].id);
    for (int i = 0; i < ecnt; i++) res.push_back(nd[Equal[i]].id);
    sort(res.begin(), res.end());
    for (int i = 0; i < scnt + ecnt; i++) printf("%d ", res[i]);
    printf("\n");
  }
  return 0;
}
