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 compet {
  double x, y;
  int ind;
};
int n;
int s[300000];
int r[300000];
double si[300000];
double ri[300000];
double epsilon = 0.000000000000000000000000000000001;
int mins, minr;
int orijent(compet a, compet b, compet c) {
  double d = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
  if (d - 0 < epsilon && 0 - d < epsilon) {
    double db, dc;
    db = (b.x - a.x) * (b.x - a.x) + (b.y - a.y) * (b.y - a.y);
    dc = (c.x - a.x) * (c.x - a.x) + (c.y - a.y) * (c.y - a.y);
    if (dc - db > epsilon) return 1;
    if (db - dc > epsilon) return -1;
    return 0;
  }
  if (d > epsilon)
    return 1;
  else
    return -1;
}
compet a[300000];
bool v[300000];
bool operator<(compet b, compet c) { return orijent(a[0], b, c) > 0; }
stack<int> b;
int next_to_top() {
  int pom, p;
  pom = b.top();
  b.pop();
  p = b.top();
  b.push(pom);
  return p;
}
int graham() {
  v[a[0].ind] = true;
  b.push(0);
  b.push(1);
  b.push(2);
  for (int i = 3; i < n; i++) {
    while (b.size() >= 2 && orijent(a[next_to_top()], a[b.top()], a[i]) <= 0)
      b.pop();
    b.push(i);
  }
  double xp = a[0].x;
  double yp = a[0].y;
  int ip = a[0].ind;
  v[ip] = true;
  while (b.size() > 0) {
    if (xp - a[b.top()].x > epsilon ||
        (a[b.top()].x - xp < epsilon && yp - a[b.top()].y < epsilon &&
         a[b.top()].y - yp < epsilon)) {
      xp = a[b.top()].x;
      yp = a[b.top()].y;
      v[a[b.top()].ind] = true;
      b.pop();
    } else
      break;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &s[i], &r[i]);
    si[i] = s[i];
    si[i] = 1 / si[i];
    ri[i] = r[i];
    ri[i] = 1 / ri[i];
    a[i].x = si[i];
    a[i].y = ri[i];
    a[i].ind = i;
  }
  if (n == 1) {
    printf("1");
    return 0;
  }
  if (n == 2) {
    if (s[0] > s[1] || r[0] > r[1]) {
      printf("1 ");
    }
    if (s[1] > s[0] || r[1] > r[0]) {
      printf("2 ");
    }
    if (s[0] == s[1] && r[0] == r[1]) {
      printf("1 2");
      return 0;
    }
    return 0;
  }
  int ind = 0;
  compet pom;
  for (int i = 1; i < n; i++) {
    if (a[ind].y - a[i].y > epsilon ||
        (a[ind].y - a[i].y < epsilon && a[i].y - a[ind].y < epsilon &&
         a[ind].x - a[i].x > epsilon))
      ind = i;
  }
  pom = a[0];
  a[0] = a[ind];
  v[ind] = true;
  a[ind] = pom;
  sort(a + 1, a + n);
  graham();
  for (int i = 1; i < n; i++) {
    if (v[a[i - 1].ind] && a[i].x - a[i - 1].x < epsilon &&
        a[i - 1].x - a[i].x < epsilon && a[i].y - a[i - 1].y < epsilon &&
        a[i - 1].y - a[i].y < epsilon) {
      v[a[i].ind] = true;
    }
  }
  for (int i = n - 2; i >= 0; i--) {
    if (v[a[i + 1].ind] && a[i].x - a[i + 1].x < epsilon &&
        a[i + 1].x - a[i].x < epsilon && a[i].y - a[i + 1].y < epsilon &&
        a[i + 1].y - a[i].y < epsilon) {
      v[a[i].ind] = true;
    }
  }
  for (int i = 0; i <= n; i++) {
    if (v[i]) printf("%d ", i + 1);
  }
  return 0;
}
