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 PI = acos(-1.0);
const double EPS = 1e-16;
struct CPoint {
  double x, y;
  int i;
  CPoint(double xx, double yy) : x(xx), y(yy) {}
  CPoint() {}
  void Read() { scanf("%lf%lf", &x, &y); }
};
struct CLine {
  CPoint a, b;
  CLine(CPoint aa, CPoint bb) : a(aa), b(bb) {}
  CLine() {}
  void Read() { scanf("%lf%lf%lf%lf", &a.x, &a.y, &b.x, &b.y); }
};
CPoint operator+(CPoint a, CPoint b) { return CPoint(a.x + b.x, a.y + b.y); }
CPoint operator-(CPoint a, CPoint b) { return CPoint(a.x - b.x, a.y - b.y); }
CPoint operator*(CPoint a, double k) { return CPoint(k * a.x, k * a.y); }
CPoint operator*(double k, CPoint a) { return CPoint(k * a.x, k * a.y); }
double operator*(CPoint a, CPoint b) { return a.x * b.x + a.y * b.y; }
CPoint operator/(CPoint a, double k) { return CPoint(a.x / k, a.y / k); }
double operator^(CPoint a, CPoint b) { return a.x * b.y - a.y * b.x; }
double cross(CPoint a, CPoint b) { return a.x * b.y - a.y * b.x; }
double Length(CPoint p) { return sqrt(p * p); }
CPoint unit(CPoint p) { return 1.0 / Length(p) * p; }
double project(CPoint p, CPoint n) { return p * (unit(n)); }
double area(CPoint a, CPoint b) { return a ^ b * 0.5; }
bool isZero(double x) { return -EPS < x && x < EPS; }
int Cmp(double x) {
  if (isZero(x)) {
    return 0;
  }
  if (x > 0) {
    return 1;
  }
  return -1;
}
double dist(CPoint p, CPoint q) { return Length(p - q); }
double dist(CPoint p, CLine l) {
  return fabs((p - l.a) ^ (p - l.b)) / Length(l.a - l.b);
}
CPoint Rotate(CPoint a, CPoint b, double alpha) {
  CPoint p = b - a;
  return CPoint(a.x + (p.x * cos(alpha) - p.y * sin(alpha)),
                a.y + (p.x * sin(alpha) + p.y * cos(alpha)));
}
int sideOfLine(CPoint p, CLine l) {
  double res = (p - l.a) ^ (p - l.b);
  if (isZero(res)) {
    return 0;
  } else {
    return res > 0 ? 1 : -1;
  }
}
CLine Vertical(CPoint p, CLine l) {
  return CLine(p, p + (Rotate(l.b, l.a, PI / 2) - l.a));
}
CPoint root(CPoint p, CLine l) {
  return l.a + project(p - l.a, l.b - l.a) * unit(l.b - l.a);
}
double angle(CLine l, CLine m) {
  return acos(fabs(project(l.b - l.a, m.b - m.a) / Length(l.b - l.a)));
}
bool PointOnSegment(CPoint p, CPoint a, CPoint b) {
  return Cmp(cross(p - a, b - a)) == 0 && Cmp((p - a) * (p - b)) <= 0;
}
CPoint GetIntersect(CLine l, CLine m, string &s) {
  if (isZero(cross(l.b - l.a, m.b - m.a))) {
    if (!sideOfLine(l.a, m)) {
      s = "LINE";
    } else {
      s = "NONE";
    }
    return CPoint(0, 0);
  }
  s = "POINT";
  double t = cross(m.b - m.a, l.a - m.a) / cross(l.b - l.a, m.b - m.a);
  return l.a + (l.b - l.a) * t;
}
CPoint GetIntersect(CLine l, CLine m) {
  double t = cross(m.b - m.a, l.a - m.a) / cross(l.b - l.a, m.b - m.a);
  return l.a + (l.b - l.a) * t;
}
bool IsCross(CLine l, CLine m) {
  return sideOfLine(l.a, m) * sideOfLine(l.b, m) <= 0 &&
         sideOfLine(m.a, l) * sideOfLine(m.b, l) <= 0;
}
int pos[300005];
bool cmp(CPoint a, CPoint b) {
  if (isZero(a.x - b.x)) {
    return a.y < b.y;
  }
  return a.x < b.x;
}
double cross(CPoint a, CPoint b, CPoint c) {
  return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
int Graham(CPoint *Pts, CPoint *st, int n) {
  sort(Pts, Pts + n, cmp);
  int m = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0 && Pts[i].x == Pts[i - 1].x && Pts[i].y == Pts[i - 1].y) {
      pos[i] = i - 1;
      continue;
    }
    pos[i] = i;
    while (m > 1 && Cmp(cross(st[m - 2], st[m - 1], Pts[i])) < 0) {
      m--;
    }
    st[m].i = Pts[i].i;
    st[m++] = Pts[i];
  }
  int k = m;
  for (int i = n - 2; i >= 0; i--) {
    while (m > k && Cmp(cross(st[m - 2], st[m - 1], Pts[i]) < 0)) {
      m--;
    }
    st[m].i = Pts[i].i;
    st[m++] = Pts[i];
  }
  return n > 1 ? m - 1 : m;
}
CPoint a[300005], b[300005];
bool v[300005];
int main() {
  int n;
  double minx = 10000.0, miny = 10000.0;
  memset(v, false, sizeof(v));
  pos[0] = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    a[i].Read();
    a[i].x = 100.0 / a[i].x;
    a[i].y = 100.0 / a[i].y;
    minx = min(minx, a[i].x);
    miny = min(miny, a[i].y);
    a[i].i = i;
  }
  int cnt = Graham(a, b, n);
  for (int i = 0; i < cnt; i++) {
    v[b[i].i] = true;
    if (isZero(b[i].y - miny)) {
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (v[a[pos[i]].i]) {
      v[a[i].i] = true;
    }
  }
  for (int i = 0; i < n; i++) {
    if (v[i]) {
      printf("%d ", i + 1);
    }
  }
  printf("\n");
  return 0;
}
