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 ind[200005], tail[200005], next_ind[200005];
struct competitor {
  int st_ind;
  long long r, s;
} v[200005], r[200005];
bool operator<(competitor a, competitor b) {
  return (a.r > b.r) || ((a.r == b.r) && (a.s > b.s));
}
bool ok(competitor a, competitor b, competitor c) {
  if ((a.r - b.r) * (a.s - c.s) * b.s * c.r -
          (a.r - c.r) * (a.s - b.s) * c.s * b.r <
      0)
    return false;
  else
    return true;
}
int n, ans[200005];
void zabat() {
  int m = 0;
  for (int i = 0; i < n; i++) {
    if (m == 0)
      v[m++] = v[i];
    else {
      if ((v[m - 1].r != v[i].r) || (v[m - 1].s != v[i].s))
        v[m++] = v[i];
      else
        tail[v[m - 1].st_ind] = next_ind[tail[v[m - 1].st_ind]] = v[i].st_ind;
    }
  }
  n = m;
}
int main() {
  scanf("%d", &n);
  int ninds = 0;
  memset(next_ind, -1, sizeof next_ind);
  for (int i = 0; i < n; i++) {
    scanf("%I64d %I64d", &v[i].r, &v[i].s);
    ind[tail[v[i].st_ind] = v[i].st_ind = ninds++] = i + 1;
    ;
  }
  sort(v, v + n);
  zabat();
  int nr = 0;
  for (int i = 0; i < n; i++) {
    if (nr == 0)
      r[nr++] = v[i];
    else {
      if (r[nr - 1].s >= v[i].s) continue;
      while ((nr >= 2) && !ok(r[nr - 2], r[nr - 1], v[i])) nr--;
      r[nr++] = v[i];
    }
  }
  int nans = 0;
  for (int i = 0; i < nr; i++)
    for (int j = r[i].st_ind; j != -1; j = next_ind[j]) ans[nans++] = ind[j];
  sort(ans, ans + nans);
  for (int i = 0; i < nans; i++) {
    if (i > 0) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
  return 0;
}
