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>
void fre() {
  freopen("c://test//input.in", "r", stdin);
  freopen("c://test//output.out", "w", stdout);
}
template <class T>
inline void scand(T &x) {
  char c;
  x = 0;
  while ((c = getchar()) < '0')
    ;
  while (c >= '0' && c <= '9') x = x * 10 + (c - 48), c = getchar();
}
template <class T>
inline void gmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline void gmin(T &a, T b) {
  if (b < a) a = b;
}
using namespace std;
const int N = 3e5 + 10, M = 0, Z = 1e9 + 7, maxint = 2147483647,
          ms31 = 522133279, ms63 = 1061109567, ms127 = 2139062143;
const double eps = 1e-8, PI = acos(-1.0);
struct point {
  int x, y, o;
};
struct segment {
  point p1, p2;
};
point a[N], p0, p1, p2;
segment b[N];
int n, i, j, s[N], top;
int ans[N];
int choose_point(point p1, point p2) {
  if (p1.y == p2.y) return p1.x < p2.x;
  return p1.y < p2.y;
}
int cp(point p0, point p1, point p2) {
  int x1, y1, x2, y2;
  x1 = p1.x - p0.x;
  y1 = p1.y - p0.y;
  x2 = p2.x - p0.x;
  y2 = p2.y - p0.y;
  return x1 * y2 - x2 * y1;
}
int angle_sort(point p1, point p2) {
  int cp_ = cp(p0, p1, p2);
  if (cp_ == 0) return p1.y < p2.y;
  return cp_ > 0;
}
void push(int o) { s[++top] = o; }
void convex() {
  sort(a + 1, a + n + 1, choose_point);
  p0 = a[1];
  sort(a + 2, a + n + 1, angle_sort);
  top = 0;
  push(1);
  if (n > 1) push(2);
  for (i = 3; i <= n; i++) {
    while (1) {
      p0 = a[s[top - 1]];
      p1 = a[s[top]];
      p2 = a[i];
      if (cp(p0, p1, p2) < 0)
        top--;
      else {
        push(i);
        break;
      }
    }
  }
  int py = 0;
  int px = 0;
  for (i = 1; i <= top; i++) {
    int o = s[i];
    if (a[o].y > a[py].y || a[o].y == a[py].y && a[o].x > a[py].x) {
      py = o;
    }
    if (a[o].x > a[px].x || a[o].x == a[px].x && a[o].y > a[px].y) {
      px = o;
    }
  }
  int m = 0;
  for (i = 1; i <= top; i++) {
    int o = s[i];
    if (o == px || o == py || a[o].y > a[px].y || a[o].x > a[py].x)
      ans[++m] = a[o].o;
  }
  sort(ans + 1, ans + m + 1);
  for (i = 1; i <= m; i++) printf("%d ", ans[i]);
  puts("");
}
int main() {
  while (~scanf("%d", &n)) {
    for (i = 1; i <= n; i++) {
      scanf("%d%d", &a[i].x, &a[i].y);
      a[i].o = i;
    }
    convex();
  }
  return 0;
}
