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;
const long double eps = 1e-22;
struct Point {
  long long first, second, pos;
} P[500005], S[500005], P2[500005];
;
int V[500005], cnt;
bool cmp2(Point a, Point b) {
  return make_pair(a.first, a.second) < make_pair(b.first, b.second);
}
void Read() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    long long x, y;
    scanf("%I64d%I64d", &x, &y);
    P[i].first = x;
    P[i].second = y;
    P[i].pos = i;
  }
  sort(P + 1, P + N + 1, cmp2);
  int cnt = 0;
  for (int i = 1; i < N; i++)
    if (P[i].first != P[i + 1].first) P2[++cnt] = P[i];
  P2[++cnt] = P[N];
  N = cnt;
  for (int i = 1; i <= N; i++) P[i] = P2[i];
}
inline bool Area(pair<long long, long long> A, pair<long long, long long> B,
                 pair<long long, long long> C) {
  return A.second * C.second * A.first * B.first -
             A.second * C.second * B.first * C.first -
             B.second * C.second * A.first * B.first <=
         A.second * B.second * A.first * C.first -
             A.second * B.second * B.first * C.first -
             B.second * C.second * A.first * C.first;
}
bool cmp(Point a, Point b) {
  pair<long long, long long> A = make_pair(P[1].first, P[1].second),
                             B = make_pair(a.first, a.second),
                             C = make_pair(b.first, b.second);
  return A.second * C.second * A.first * B.first -
             A.second * C.second * B.first * C.first -
             B.second * C.second * A.first * B.first <=
         A.second * B.second * A.first * C.first -
             A.second * B.second * B.first * C.first -
             B.second * C.second * A.first * C.first;
}
inline bool Equal(long long x, long long y) { return x == y; }
void Solve() {
  int Min = 1, Min2 = 1;
  for (int i = 2; i <= N; i++)
    if (P[i].first > P[Min].first ||
        (Equal(P[i].first, P[Min].first) && P[i].second > P[Min].second))
      Min = i;
  Point aux;
  aux = P[1];
  P[1] = P[Min];
  P[Min] = aux;
  sort(P + 2, P + N + 1, cmp);
  if (N > 5) {
    cout << Min << "\n";
    ;
    return;
  }
  for (int i = 2; i <= N; i++) {
    if (P[i].second > P[Min2].second ||
        (Equal(P[i].second, P[Min2].second) && P[i].first > P[Min2].first))
      Min2 = i;
  }
  S[1] = P[1];
  S[2] = P[2];
  int k = 2;
  Min2 = P[Min2].pos;
  for (int i = 3; i <= N; i++) {
    while (k >= 2 && Area(make_pair(S[k - 1].first, S[k - 1].second),
                          make_pair(S[k].first, S[k].second),
                          make_pair(P[i].first, P[i].second)) == 0)
      k--;
    S[++k] = P[i];
  }
  int Pmin = 1;
  for (int i = 1; i <= k; i++) {
    V[++cnt] = S[i].pos;
    if (S[i].second == Min2) break;
  }
  sort(V + 1, V + cnt + 1);
  for (int i = 1; i <= cnt; i++) printf("%d ", V[i]);
  printf("\n");
}
int main() {
  Read();
  Solve();
  return 0;
}
