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-10;
const double PI = acos(-1.0);
const double BASE = 10000;
const int maxn = 200000 + 10;
int dcmp(double x) {
  if (fabs(x) < eps)
    return 0;
  else
    return x > 0 ? 1 : -1;
}
struct Point {
  double x, y;
  int id;
  Point(double x = 0, double y = 0, int id = 0) : x(x), y(y), id(id) {}
};
Point operator+(Point A, Point B) { return Point(A.x + B.x, A.y + B.y); }
Point operator-(Point A, Point B) { return Point(A.x - B.x, A.y - B.y); }
Point operator*(Point A, double p) { return Point(A.x * p, A.y * p); }
Point operator/(Point A, double p) { return Point(A.x / p, A.y / p); }
bool operator==(const Point& A, const Point& B) {
  return dcmp(A.x - B.x) == 0 && dcmp(A.y - B.y) == 0;
}
bool operator<(const Point& A, const Point& B) {
  return A.x < B.x || (A.x == B.x && A.y < B.y);
}
double Dot(Point A, Point B) { return A.x * B.x + A.y * B.y; }
double Cross(Point A, Point B) { return A.x * B.y - A.y * B.x; }
Point p[maxn];
int n;
int top, Stack[maxn];
bool ok[maxn];
bool ans[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    double x, y;
    scanf("%lf%lf", &x, &y);
    p[i] = Point(BASE / x, BASE / y, i + 1);
  }
  sort(p, p + n);
  top = 0;
  for (int i = 0; i < n; ++i) {
    if (i && dcmp(p[i].x - p[i - 1].x) == 0) continue;
    while (top > 1 && dcmp(Cross(p[Stack[top - 1]] - p[Stack[top - 2]],
                                 p[i] - p[Stack[top - 2]])) < 0)
      --top;
    Stack[top++] = i;
  }
  memset(ans, 0, sizeof(ans));
  for (int i = 0; i < top; ++i) {
    if (!i || dcmp(p[Stack[i]].y - p[Stack[i - 1]].y) < 0) {
      ok[Stack[i]] = 1;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i && dcmp(p[i].x - p[i - 1].x) == 0 && dcmp(p[i].y - p[i - 1].y) == 0)
      ok[i] |= ok[i - 1];
    if (ok[i]) ans[p[i].id] = 1;
  }
  for (int i = 1; i <= n; ++i)
    if (ans[i]) printf("%d ", i);
  putchar('\n');
  return 0;
}
