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;
int n;
int ans[200005];
struct mode {
  int ss, rr;
  double s, r;
  bool win;
  int num;
} player[200005];
struct mod {
  double time;
  int last;
} queue[200005];
bool cmp(mode a, mode b) { return a.s > b.s; }
double cal_cross(int a, int b) {
  double k1 = 1.0 / (double)player[a].r;
  double k2 = 1.0 / (double)player[b].r;
  double c1 = 1.0 / (double)player[a].s;
  double c2 = 1.0 / (double)player[b].s;
  double up = (player[a].s - player[b].s) * player[a].r * player[b].r;
  double down = player[b].s * player[a].s * (player[b].r - player[a].r);
  double x = up / down;
  return x;
}
bool eq(double a, double b) {
  if (abs(a - b) <= 10e-10) return 1;
  return 0;
}
void work() {
  int tmp = 1;
  player[1].win = 1;
  for (int i = 2; i <= n; i++) {
    if (player[i].r < player[tmp].r) continue;
    double cross_time = cal_cross(i, tmp);
    int ret = tmp;
    while (cross_time < queue[ret].time &&
           eq(cross_time, queue[ret].time) == 0) {
      player[ret].win = 0;
      ret = queue[ret].last;
      cross_time = cal_cross(i, ret);
    }
    player[i].win = 1;
    queue[i].last = ret;
    queue[i].time = cross_time;
    tmp = i;
  }
  for (int i = 1; i <= n; i++)
    if (player[i].win == 1) ans[0]++, ans[ans[0]] = player[i].num;
  sort(ans + 1, ans + 1 + ans[0]);
  for (int i = 1; i <= ans[0]; i++) printf("%d ", ans[i]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &player[i].ss, &player[i].rr);
    player[i].num = i;
    player[i].s = player[i].ss;
    player[i].r = player[i].rr;
  }
  sort(player + 1, player + 1 + n, cmp);
  work();
  return 0;
}
