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;
struct frac {
  long long n, d;
  frac() : n(0), d(1) {}
  frac(long long x) : n(x), d(1) {}
  frac(long long _n, long long _d) : n(_n), d(_d) {
    if (d < 0) {
      d = -d;
      n = -n;
    }
  }
  frac operator-(frac f) { return frac(n * f.d - d * f.n, d * f.d); }
  frac operator*(const frac f) const { return frac(n * f.n, d * f.d); }
  bool operator<(const frac f) const {
    if (d <= 0 || f.d <= 0) exit(1);
    return n * f.d < d * f.n;
  }
  bool operator==(const frac f) const {
    if (d <= 0 || f.d <= 0) exit(1);
    return n * f.d == d * f.n;
  }
};
struct point {
  frac x, y;
  int i;
  point() : x(), y() {}
  point(frac x, frac y) : x(x), y(y) {}
  point(frac x, frac y, int i) : x(x), y(y), i(i) {}
  point operator-(point p) { return point(x - p.x, y - p.y); }
  bool operator<(const point p) const {
    if (x == p.x) return y < p.y;
    return x < p.x;
  }
  bool operator==(const point p) const { return x == p.x && y == p.y; }
};
ostream& operator<<(ostream& o, frac f) {
  if (f.n % f.d)
    o << f.n << "/" << f.d;
  else
    o << f.n / f.d;
  return o;
}
ostream& operator<<(ostream& o, point p) {
  o << "(" << p.x << ", " << p.y << ")";
  return o;
}
frac cross(point a, point b) { return a.x * b.y - b.x * a.y; }
int ccw(point a, point b, point c) {
  frac x = cross(b - a, c - a);
  return x == frac(0) ? 0 : x < frac(0) ? -1 : 1;
}
vector<point> convex_hull(vector<point> p) {
  int n = p.size(), s = 0, u;
  if (n < 3) return p;
  vector<point> h(2 * n + 2);
  sort(p.begin(), p.end());
  for (int i = 0; i < n; i++) {
    while (s > 1 && ccw(h[s - 1], h[s - 2], p[i]) < 0) s--;
    h[s++] = p[i];
  }
  u = s;
  for (int i = n - 2; i >= 0; i--) {
    while (s > u && ccw(h[s - 1], h[s - 2], p[i]) < 0) s--;
    h[s++] = p[i];
  }
  h.resize(s);
  return h;
}
void test() {
  point a(0, 0), b(2, 3), c(3, 8);
  point d(4, 6), e(2, -2), f(4, 2);
  point g(5, 1), h(-4, -5);
  assert(ccw(a, b, c) == 1);
  assert(ccw(a, b, e) == -1);
  assert(ccw(a, b, d) == 0);
  convex_hull(vector<point>({a, b, c, d, e, f, g, h}));
}
int N, S, R;
vector<point> P;
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) {
    cin >> S >> R;
    P.push_back(point(frac(1, S), frac(1, R), i));
  }
  P = convex_hull(P);
  point p = P[0];
  for (int i = P.size() - 1; i >= 0; i--) {
    if (P[i].y < p.y) p = P[i];
  }
  set<int> res;
  for (int i = 0; i < P.size(); i++) {
    if (!(P[0] == p) && ccw(P[0], P[i], p) >= 0 || P[i] == P[0]) {
      res.insert(P[i].i);
    }
  }
  for (int x : res) {
    cout << x << ' ';
  }
  cout << '\n';
}
