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;
double eps = 1e-20;
int n, m;
struct Point {
  int x, y;
  int i;
};
int cmp(const Point &p1, const Point &p2) {
  return p1.x < p2.x || (p1.x == p2.x && p1.y < p2.y);
}
int cmp2(const Point &p1, const Point &p2) { return p1.i < p2.i; }
double inter(Point &p1, Point &p2) {
  return (p2.y - p1.y) * (p1.x - p2.x) <= 0;
}
int judge(Point &p1, Point &p2, Point &p3) {
  return (long long)(p2.y - p1.y) * (p2.x - p3.x) * p1.x * p3.y -
             (long long)(p3.y - p2.y) * (p1.x - p2.x) * p3.x * p1.y <
         0;
}
Point p[1000000];
int ans[1000000];
map<pair<int, int>, vector<int> > ft;
int main() {
  while (cin >> n) {
    vector<Point> nima;
    for (int i = 0; i < n; ++i) {
      Point pt;
      cin >> pt.x >> pt.y;
      pt.i = i;
      if (ft[make_pair(pt.x, pt.y)].size() == 0) {
        nima.push_back(pt);
      }
      ft[make_pair(pt.x, pt.y)].push_back(i);
    }
    sort(nima.begin(), nima.end(), cmp);
    int top = 0;
    for (int i = 0; i < nima.size(); ++i) {
      if (!(nima[i].x == p[top - 1].x && nima[i].y == p[top - 1].y)) {
        while (top > 0 &&
               ((nima[i].x == p[top - 1].x && nima[i].y > p[top - 1].y) ||
                inter(nima[i], p[top - 1])))
          --top;
        while (top > 1 && judge(nima[i], p[top - 1], p[top - 2])) --top;
      }
      p[top++] = nima[i];
    }
    int m = 0;
    for (int i = 0; i < top; ++i) {
      vector<int> &kao = ft[make_pair(p[i].x, p[i].y)];
      for (int j = 0; j < kao.size(); ++j) {
        ans[m++] = kao[j];
      }
    }
    sort(ans, ans + m);
    for (int i = 0; i < m; ++i) cout << ans[i] + 1 << " ";
    cout << endl;
  }
}
