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 = 200010;
const double INF = 1e15;
const double EPS = 1e-15;
int sig(double x) { return (x < -EPS) ? -1 : (x > EPS) ? 1 : 0; }
struct Point {
  double x, y;
  int id;
  Point(double x = 0, double y = 0) : x(x), y(y) { id = 0; }
};
Point operator+(const Point a, const Point b) {
  return Point(a.x + b.x, a.y + b.y);
}
Point operator-(const Point a, const Point b) {
  return Point(a.x - b.x, a.y - b.y);
}
double operator*(const Point a, const Point b) { return a.x * b.y - a.y * b.x; }
double operator^(const Point a, const Point b) { return a.x * b.x + a.y * b.y; }
Point operator*(const Point a, const double x) {
  return Point(a.x * x, a.y * x);
}
Point operator/(const Point a, const double x) {
  return Point(a.x / x, a.y / x);
}
double cross(const Point &a, const Point &b) { return (a.x * b.y - a.y * b.x); }
double dot(const Point &a, const Point &b) { return (a.x * b.x + a.y * b.y); }
double dis2(Point a, Point b) {
  return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
int N;
Point p[maxN], stk[maxN];
int cnt;
bool operator<(const Point a, const Point b) {
  double dir = cross((a - stk[1]), (b - stk[1]));
  if (dir == 0) return dis2(a, stk[1]) < dis2(b, stk[1]);
  return dir > 0;
}
int compare(Point x, Point y) {
  double dis = (x - stk[1]) * (y - stk[1]);
  if (sig(dis) == 0) return dis2(x, stk[1]) > dis2(y, stk[1]);
  return dis > 0;
}
int MakeHull(Point *ps, int n) {
  int to = 1;
  int cnt;
  for (int i = 2; i <= n; i++)
    if (ps[to].x > ps[i].x || (ps[to].x == ps[i].x && ps[to].y > ps[i].y))
      to = i;
  swap(ps[1], ps[to]);
  stk[1] = ps[1];
  sort(ps + 2, ps + n + 1, compare);
  cnt = 0;
  for (int i = 1; i <= n; i++) {
    while (cnt >= 2 &&
           cross((ps[i] - stk[cnt - 1]), (stk[cnt] - stk[cnt - 1])) >= 0) {
      if (fabs(stk[cnt - 1].x - stk[cnt].x) > EPS ||
          fabs(stk[cnt - 1].y - stk[cnt].y) > EPS)
        cnt--;
      else
        break;
    }
    stk[++cnt] = ps[i];
  }
  if (cnt > 4) {
    if (cross((stk[cnt] - stk[cnt - 2]), (stk[cnt - 1] - stk[cnt - 2])) >= 0)
      if (fabs(stk[cnt - 1].x - stk[cnt].x) > EPS ||
          fabs(stk[cnt - 1].y - stk[cnt].y) > EPS)
        cnt--;
  }
  for (int i = 1; i <= cnt; i++) ps[i] = stk[i];
  return cnt;
}
int main() {
  int ans = 0;
  double s, r;
  double miniy = INF;
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%lf%lf", &s, &r);
    p[i].x = 10000 / s;
    p[i].y = 10000 / r;
    p[i].id = i;
    miniy = min(miniy, p[i].y);
  }
  N = MakeHull(p, N);
  int ids[maxN];
  int num = 0;
  p[N + 1].y = p[N + 1].x = INF;
  for (int i = 1; i <= N; i++) {
    ids[num++] = p[i].id;
    if (fabs(p[i].y - p[i + 1].y) < EPS) continue;
    if (fabs(p[i].y - miniy) < EPS) break;
  }
  sort(ids, ids + num);
  for (int i = 0; i < num; i++) printf("%d ", ids[i]);
  printf("\n");
  return 0;
}
