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;
const int MAXN = 200005;
int N;
int x[MAXN], y[MAXN];
int idx[MAXN];
vector<int> hull, V, sol;
void load() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d%d", x + i, y + i);
    idx[i] = i;
  }
}
bool cmp(const int &lhs, const int &rhs) {
  if (x[lhs] != x[rhs]) return x[lhs] > x[rhs];
  return y[lhs] > y[rhs];
}
bool eq(int lhs, int rhs) { return !cmp(lhs, rhs) && !cmp(rhs, lhs); }
bool bad(int a, int b, int c) {
  return (long long)x[b] * x[c] * y[a] * (y[c] - y[b]) +
             (long long)x[c] * x[a] * y[b] * (y[a] - y[c]) +
             (long long)x[a] * x[b] * y[c] * (y[b] - y[a]) <
         0;
}
bool ok(int pos) {
  if (!pos) return 1;
  int a = V[pos];
  int b = V[pos - 1];
  if (V[pos] == 105994) {
    puts("pecalba");
    printf("%d %d %d %d\n", x[a], y[a], x[b], y[b]);
  }
  if (x[a] < x[b]) return y[a] > y[b];
  if (V[pos] == 105994) puts("pecalba");
  assert(x[a] == x[b]);
  if (y[a] < y[b]) return 0;
  if (V[pos] == 105994) puts("pecalba");
  if (pos + 1 == V.size()) return 1;
  if (V[pos] == 105994) puts("pecalba");
  return x[a] > x[V[pos + 1]];
}
void solve() {
  sort(idx, idx + N, cmp);
  for (int i = 0; i < N; i++) {
    while (hull.size() > 1 && bad(hull[hull.size() - 2], hull.back(), idx[i]))
      hull.pop_back();
    hull.push_back(idx[i]);
  }
  V.push_back(hull[0]);
  for (int i = 1; i < hull.size(); i++)
    if (!eq(hull[i], V.back())) V.push_back(hull[i]);
  int j = 0;
  for (int i = 0; i < V.size(); i++) {
    if (!ok(i)) continue;
    if (V[i] == 105994) puts("mecalba");
    for (; j < hull.size() && eq(hull[j], V[i]); j++) sol.push_back(hull[j]);
  }
  sort(sol.begin(), sol.end());
  for (int i = 0; i < sol.size(); i++) printf("%d ", ++sol[i]);
  puts("");
}
int main() {
  load();
  solve();
  return 0;
}
