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-16;
int sig(double x) { return (x < -EPS) ? -1 : (x > EPS) ? 1 : 0; }
bool cmp(double x) { return x < 0 || fabs(x) < EPS; }
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);
}
bool operator==(const Point a, const Point b) {
  return (fabs(a.x - b.x) < EPS && fabs(a.y - b.y) < EPS);
}
bool operator<(const Point a, const Point b) {
  return a.x < b.x || (fabs(a.x - b.x) < EPS && a.y < b.y);
}
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 pos[maxN];
bool ans[maxN];
int cnt;
bool compare1(const Point a, const Point b) {
  double dir = cross((a - stk[1]), (b - stk[1]));
  if (sig(dir) == 0) return dis2(a, stk[1]) < dis2(b, stk[1]);
  return dir > 0;
}
int compare(Point x, Point y) { return (x - stk[1]) * (y - stk[1]) > 0; }
int MakeHull(Point *ps, int n) {
  int cnt;
  sort(ps, ps + n);
  cnt = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0 && p[i] == p[i - 1]) {
      pos[i] = pos[i - 1];
      continue;
    }
    pos[i] = i;
    while (cnt > 1 && cmp(cross(stk[cnt - 1] - stk[cnt - 2],
                                ps[i] - stk[cnt - 2])) == true)
      cnt--;
    stk[cnt++] = ps[i];
  }
  int k = cnt;
  for (int i = n - 2; i >= 0; i--) {
    while (cnt > k && cmp(cross(stk[cnt - 1] - stk[cnt - 2],
                                ps[i] - stk[cnt - 2]) == true))
      cnt--;
    stk[cnt++] = ps[i];
  }
  if (n > 1) cnt--;
  return cnt;
}
int main() {
  double s, r;
  double minix = INF;
  double miniy = INF;
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%lf%lf", &s, &r);
    p[i].x = 1000000 / s;
    p[i].y = 1000000 / r;
    p[i].id = i;
    miniy = min(miniy, p[i].y);
    minix = min(minix, p[i].x);
  }
  int tot = MakeHull(p, N);
  for (int i = 0; i < tot; i++) {
    ans[stk[i].id] = true;
    if (fabs(stk[i].y - miniy) < EPS) break;
  }
  for (int i = 0; i < N; i++) {
    if (ans[p[pos[i]].id] == true) ans[p[i].id] = true;
  }
  for (int i = 0; i < N; i++)
    if (ans[i] == true) printf("%d ", i + 1);
  printf("\n");
  return 0;
}
