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 
5
10 50
10 50
10 50
10 50
10 50
 2
10000 10000
10000 10000
 3
10000 10000
10000 10000
10000 10000
 3
1000 3000
1500 1500
3000 1000
 43
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 1
1 1
 2
1 1
1 1
 44
78 52
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 3
1000 3000
1499 1499
3000 1000
 5
50 50
49 50
50 49
49 49
50 1
 18
82 38
33 69
33 69
33 69
33 69
33 69
82 38
33 69
33 69
33 69
82 38
33 69
33 69
82 38
82 38
33 69
33 69
33 69
 1
10000 9999
 3
1000 3000
1501 1501
3000 1000
 2
1 2
2 1

1 2 3 4 5
 1 2
 1 2 3
 1 2 3
 1 3 16 24 29 31 32 37 41 42
 1
 1 2
 1
 1 3
 1
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 1
 1 2 3
 1 2 

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const double EPS = 1e-8;
int n;
struct Point {
  int index;
  double x, y;
  Point() : x(0.0), y(0.0) {}
  Point(double _x, double _y) : x(_x), y(_y) {}
} point[MAXN];
inline int compare(const double &x) {
  if (fabs(x) < EPS) {
    return 0;
  }
  return x > 0 ? 1 : -1;
}
inline int compare(const double &x, const double &y) { return compare(x - y); }
inline Point operator+(const Point &a, const Point &b) {
  return Point(a.x + b.x, a.y + b.y);
}
inline Point operator-(const Point &a, const Point &b) {
  return Point(a.x - b.x, a.y - b.y);
}
inline double operator*(const Point &a, const Point &b) {
  return a.x * b.x + a.y * b.y;
}
inline double operator^(const Point &a, const Point &b) {
  return a.x * b.y - a.y * b.x;
}
inline double cross(const Point &a, const Point &b, const Point &o) {
  return (a - o) ^ (b - o);
}
inline bool operator<(const Point &a, const Point &b) {
  if (compare(a.y, b.y) == 0) {
    return a.x < b.x;
  }
  return a.y < b.y;
}
int stk[MAXN], top;
void graham() {
  if (n == 1) {
    top = 1;
    stk[0] = 0;
    return;
  }
  sort(point, point + n);
  top = 2;
  stk[0] = 0, stk[1] = 1;
  for (int i = 2; i < n; ++i) {
    while (top > 1 && compare(cross(point[i], point[stk[top - 1]],
                                    point[stk[top - 2]])) >= 0) {
      --top;
    }
    stk[top++] = i;
  }
  int halfTop = top;
  stk[top++] = n - 2;
  for (int i = n - 3; i >= 0; --i) {
    while (top > halfTop && compare(cross(point[i], point[stk[top - 1]],
                                          point[stk[top - 2]])) >= 0) {
      --top;
    }
    stk[top++] = i;
  }
}
int main() {
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; ++i) {
      point[i].index = i + 1;
      scanf("%lf%lf", &point[i].x, &point[i].y);
      point[i].x = 1.0 / point[i].x;
      point[i].y = 1.0 / point[i].y;
    }
    graham();
    set<int> ans;
    for (int i = top - 1; i >= 0; --i) {
      ans.insert(point[stk[i]].index);
      if (compare(point[stk[i - 1]].x, point[stk[i]].x) >= 0) {
        break;
      }
    }
    for (auto a : ans) {
      printf("%d ", a);
    }
    putchar('\n');
  }
  return 0;
}
