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 sigma_size = 26;
const int N = 100 + 50;
const int MAXN = 200000 + 50;
const int inf = 0x3fffffff;
const double eps = 1e-8;
const int HASH = 100007;
const int mod = 1000000000 + 7;
int n, tot;
int ans[MAXN];
struct Point {
  int id;
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
} p[MAXN], poly[MAXN];
map<pair<double, double>, int> mp;
vector<int> vec[MAXN];
Point operator+(Point a, Point b) { return Point(a.x + b.x, a.y + b.y); }
Point operator-(Point a, Point b) { return Point(a.x - b.x, a.y - b.y); }
Point operator*(Point a, double k) { return Point(k * a.x, k * a.y); }
Point operator/(Point a, double k) { return Point(a.x / k, a.y / k); }
int dcmp(double x) {
  if (fabs(x) < eps)
    return 0;
  else
    return x < 0 ? -1 : 1;
}
bool operator==(Point a, Point b) {
  return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
void init() {
  tot = 0;
  mp.clear();
  for (int i = 0; i < n; i++) vec[i].clear();
}
bool cmp(Point a, Point b) {
  if (a.x == b.x) return a.y > b.y;
  return a.x > b.x;
}
bool cmp1(Point a, Point b) {
  if (a.y == b.y) return a.x > b.x;
  return a.y > b.y;
}
double cross(Point p1, Point p2, Point p0) {
  return (p0.x - p1.x) * (p0.y - p2.y) * p2.x * p1.y -
         (p0.x - p2.x) * (p0.y - p1.y) * p1.x * p2.y;
}
int Andrew(int n) {
  sort(p, p + n, cmp);
  int top = -1;
  for (int i = 0; i < n; i++) {
    while (top > 0 && cross(p[i], poly[top], poly[top - 1]) > 0) top--;
    poly[++top] = p[i];
  }
  int num = top;
  for (int i = n - 2; i >= 0; i--) {
    while (top > num && cross(p[i], poly[top], poly[top - 1]) > 0) top--;
    poly[++top] = p[i];
  }
  return top;
}
int main() {
  while (~scanf("%d", &n)) {
    init();
    for (int i = 0; i < n; i++) {
      double x, y;
      scanf("%lf%lf", &x, &y);
      pair<double, double> tmp = make_pair(x, y);
      if (mp.count(tmp) == 0) {
        mp[tmp] = tot;
        p[tot].x = tmp.first;
        p[tot].y = tmp.second;
        p[tot].id = tot;
        tot++;
      }
      vec[mp[tmp]].push_back(i + 1);
    }
    int num = 0;
    if (tot <= 2) {
      for (int i = 0; i < tot; i++)
        for (int j = 0; j < vec[i].size(); j++) ans[num++] = vec[i][j];
      sort(ans, ans + num);
      for (int i = 0; i < num; i++) {
        if (i) printf(" ");
        printf("%d", ans[i]);
      }
      printf("\n");
      continue;
    }
    int top = Andrew(tot);
    sort(poly, poly + top, cmp1);
    Point tmp = poly[0];
    sort(poly, poly + top, cmp);
    int cnt = -1;
    for (int i = 0; i < top; i++) {
      while (cnt > 0 && cross(poly[i], p[cnt], p[cnt - 1]) > 0) cnt--;
      p[++cnt] = poly[i];
      if (p[cnt] == tmp) break;
    }
    for (int i = 0; i <= cnt; i++) {
      for (int j = 0; j < vec[p[i].id].size(); j++)
        ans[num++] = vec[p[i].id][j];
    }
    sort(ans, ans + num);
    num = unique(ans, ans + num) - ans;
    for (int i = 0; i < num; i++) {
      if (i) printf(" ");
      printf("%d", ans[i]);
    }
    printf("\n");
  }
  return 0;
}
