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 double EPS = 1e-10;
const double DINF = 1e30;
inline int sgn(double a) { return a > EPS ? 1 : (a < -EPS ? -1 : 0); }
struct Point {
  long long x, y;
  int id;
  Point() { x = y = id = 0; }
  Point(long long _x, long long _y, int _id) : x(_x), y(_y), id(_id) {}
  Point(long long _x, long long _y) : x(_x), y(_y) { id = 0; }
  Point &operator=(const Point &a) {
    x = a.x;
    y = a.y;
    id = a.id;
    return *this;
  }
  bool operator==(const Point &a) { return x == a.x && y == a.y; }
  void read() { scanf("%I64d %I64d", &x, &y); }
};
struct Comparator {
  bool operator()(const Point &a, const Point &b) {
    return a.x > b.x || (a.x == b.x && a.y > b.y);
  }
};
inline int sgn(const Point &a, const Point &b) {
  double res1;
  if (a.x == 0) {
    res1 = a.y > 0 ? DINF : -DINF;
  } else {
    res1 = (double)a.y / a.x;
  }
  double res2;
  if (b.x == 0) {
    res2 = b.y > 0 ? DINF : -DINF;
  } else {
    res2 = (double)b.y / b.x;
  }
  return sgn(res1 - res2);
}
inline long long det(const Point &a, const Point &b, const Point &c) {
  return (a.x - b.x) * (a.y - c.y) * c.x * b.y -
         (a.y - b.y) * (a.x - c.x) * c.y * b.x;
}
const int MAX_N = 200005;
int n;
Point p[MAX_N];
Point stack[MAX_N];
Point minSlope[MAX_N];
Point maxSlope[MAX_N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    p[i].read();
    p[i].id = i;
  }
  sort(p, p + n, Comparator());
  int m = 1;
  for (int i = 1; i < n; i++) {
    if (p[i].y > p[i - 1].y || p[i] == p[i - 1]) {
      p[m++] = p[i];
    }
  }
  int top = 0;
  for (int i = 0; i < m; i++) {
    if (i > 0 && p[i] == p[i - 1]) {
      maxSlope[i] = maxSlope[i - 1];
    } else {
      int l = 0, r = top - 1;
      Point ans = Point(0, -1);
      while (l <= r) {
        int mid = (l + r) >> 1;
        Point slope;
        slope.x = p[i].y * stack[mid].y * (stack[mid].x - p[i].x);
        slope.y = p[i].x * stack[mid].x * (stack[mid].y - p[i].y);
        Point _slope;
        if (mid == 0) {
          _slope.x = 0;
          _slope.y = -1;
        } else {
          _slope.x = stack[mid - 1].y * stack[mid].y *
                     (stack[mid - 1].x - stack[mid].x);
          _slope.y = stack[mid - 1].x * stack[mid].x *
                     (stack[mid - 1].y - stack[mid].y);
        }
        if (sgn(slope, _slope) >= 0) {
          ans = slope;
          l = mid + 1;
        } else {
          r = mid - 1;
        }
      }
      maxSlope[i] = ans;
      while (top >= 2 && det(p[i], stack[top - 1], stack[top - 2]) <= 0) {
        top--;
      }
      stack[top++] = p[i];
    }
  }
  top = 0;
  for (int i = m - 1; i >= 0; i--) {
    if (i + 1 < m && p[i] == p[i + 1]) {
      minSlope[i] = minSlope[i + 1];
    } else {
      int l = 0, r = top - 1;
      Point ans = Point(0, 1);
      while (l <= r) {
        int mid = (l + r) >> 1;
        Point slope;
        slope.x = p[i].y * stack[mid].y * (stack[mid].x - p[i].x);
        slope.y = p[i].x * stack[mid].x * (stack[mid].y - p[i].y);
        Point _slope;
        if (mid == 0) {
          _slope.x = 0;
          _slope.y = 1;
        } else {
          _slope.x = stack[mid - 1].y * stack[mid].y *
                     (stack[mid - 1].x - stack[mid].x);
          _slope.y = stack[mid - 1].x * stack[mid].x *
                     (stack[mid - 1].y - stack[mid].y);
        }
        if (sgn(slope, _slope) <= 0) {
          ans = slope;
          l = mid + 1;
        } else {
          r = mid - 1;
        }
      }
      minSlope[i] = ans;
      while (top >= 2 && det(p[i], stack[top - 1], stack[top - 2]) <= 0) {
        top--;
      }
      stack[top++] = p[i];
    }
  }
  vector<int> ans;
  for (int i = 0; i < m; i++) {
    if (sgn(minSlope[i], maxSlope[i]) > 0) {
      ans.push_back(p[i].id + 1);
    }
  }
  sort(ans.begin(), ans.end());
  printf("%d", ans[0]);
  for (int i = 1; i < (int)ans.size(); i++) {
    printf(" %d", ans[i]);
  }
  printf("\n");
  return 0;
}
