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>
inline int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return x;
}
const int MAXN = 300005;
int n, q[MAXN], siz;
bool ans[MAXN];
std::vector<int> v[MAXN];
struct Missle {
  long double k, b;
  int id;
  friend bool operator<(Missle x, Missle y) {
    return x.k == y.k ? x.b < y.b : x.k > y.k;
  }
  friend bool operator==(Missle x, Missle y) {
    return x.k == y.k && x.b == y.b;
  }
  friend bool operator!=(Missle x, Missle y) {
    return x.k != y.k || x.b != y.b;
  }
} mis[MAXN], m[MAXN];
inline long double getx(int x, int y) {
  return (m[x].b - m[y].b) / (m[y].k - m[x].k);
}
int main() {
  n = read();
  int nn = 0;
  for (int i = 1; i <= n; i++) {
    int uu = read(), vv = read();
    if (uu == 0 || vv == 0) continue;
    mis[++nn].k = (long double)1.0 / uu;
    mis[nn].b = (long double)100000000.0 / vv;
    mis[nn].id = i;
  }
  std::swap(n, nn);
  std::sort(mis + 1, mis + n + 1);
  for (int i = 1; i <= n; i++) {
    if (i == 1 || mis[i] != mis[i - 1]) m[++siz] = mis[i];
    v[siz].push_back(mis[i].id);
  }
  int h = 1, t = 0;
  for (int i = 1; i <= siz; i++) {
    if (i != 1 && m[i].k == m[i - 1].k) continue;
    while (h < t && getx(q[t], i) < getx(q[t - 1], q[t])) t--;
    q[++t] = i;
  }
  for (int i = h; i <= t; i++) {
    if (i != t && getx(q[i], q[i + 1]) < 0) continue;
    for (int j = 0; j < v[q[i]].size(); j++) ans[v[q[i]][j]] = 1;
  }
  std::swap(n, nn);
  for (int i = 1; i <= n; i++)
    if (ans[i]) printf("%d ", i);
  printf("\n");
  return 0;
}
