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 N = 200000;
const double eps = 1e-22;
int s[N], r[N];
struct Point {
  double x;
  double y;
  void init(int a, int b) {
    x = 1.0 / a;
    y = 1.0 / b;
  }
  void operator=(Point P) {
    x = P.x;
    y = P.y;
  }
  bool operator!=(Point P) { return (x != P.x || y != P.y); }
  bool operator==(Point P) { return (x == P.x && y == P.y); }
  pair<double, double> pii() { return make_pair(x, y); }
};
inline void print(Point P) { cout << P.x << " " << P.y << " " << endl; }
map<pair<double, double>, vector<int> > data;
vector<Point> plane;
vector<Point> hull;
vector<int> ans;
Point corner = {100.0, 100.0};
Point lefft = {100.0, 100.0};
inline double isLeft(Point P0, Point P1, Point P2) {
  return ((P1.x - P0.x) * (P2.y - P0.y) - (P1.y - P0.y) * (P2.x - P0.x));
}
inline double dis(Point P1, Point P2) {
  return ((P1.x - P2.x) * (P1.x - P2.x) + (P1.y - P2.y) * (P1.y - P2.y));
}
inline bool ocmp(const Point &a, const Point &b) {
  return make_pair(a.y, a.x) < make_pair(b.y, b.x);
}
inline bool lcmp(const Point &a, const Point &b) {
  return make_pair(a.x, a.y) < make_pair(b.x, b.y);
}
bool compare(Point P1, Point P2) {
  double res = isLeft(corner, P1, P2);
  if (fabs(res) <= eps) return (dis(corner, P1) < dis(corner, P2));
  return res < eps;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d %d", s + i, r + i);
  for (int i = 0; i < n; i++) {
    Point P;
    P.init(s[i], r[i]);
    plane.push_back(P);
    data[P.pii()].push_back(i + 1);
  }
  if (data.size() == 1) {
    for (int i = 1; i <= n; i++) printf("%d ", i);
    return 0;
  }
  corner = *min_element(plane.begin(), plane.end(), ocmp);
  lefft = *min_element(plane.begin(), plane.end(), lcmp);
  if (corner == lefft) {
    vector<int>::iterator i;
    for (i = data[corner.pii()].begin(); i != data[corner.pii()].end(); i++)
      printf("%d ", *i);
    return 0;
  }
  sort(plane.begin(), plane.end(), compare);
  int ii = 0;
  hull.push_back(plane[ii++]);
  hull.push_back(plane[ii++]);
  while (hull[hull.size() - 1] != lefft) {
    while (hull.size() > 1 && isLeft(hull[hull.size() - 2],
                                     hull[hull.size() - 1], plane[ii]) >= 0.0)
      hull.pop_back();
    hull.push_back(plane[ii++]);
  }
  for (int i = 0; i < hull.size(); i++) {
    vector<int>::iterator j;
    for (j = data[hull[i].pii()].begin(); j != data[hull[i].pii()].end(); j++)
      ans.push_back(*j);
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  return 0;
}
