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;
struct pers {
  int a, b, id;
};
pers A[300000], B[300000];
bool cmp(pers f, pers s) { return f.a > s.a || (f.a == s.a && f.b > s.b); }
set<pair<int, int> > F;
vector<pair<int, int> > Q;
set<pair<int, int> > pos;
int main() {
  srand(time(0));
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    scanf("%d %d", &A[i].a, &A[i].b), A[i].id = i, B[i].a = A[i].a,
                                      B[i].b = A[i].b;
  sort(A + 1, A + n + 1, cmp);
  vector<int> answer;
  int maxvalb = 0, ptmaxvalb = 0, lasta = A[1].a;
  for (int i = 1; i <= n; i++) {
    if (lasta == A[i].a &&
        (A[i].b > maxvalb || (A[i].b == maxvalb && ptmaxvalb == A[i].a))) {
      answer.push_back(A[i].id);
      F.insert(make_pair(A[i].a, A[i].b));
      maxvalb = A[i].b;
      ptmaxvalb = A[i].a;
    }
    if (lasta != A[i].a && A[i].b > maxvalb) {
      answer.push_back(A[i].id);
      F.insert(make_pair(A[i].a, A[i].b));
      maxvalb = A[i].b;
      ptmaxvalb = A[i].a;
    }
    lasta = A[i].a;
  }
  for (auto x : F) Q.push_back(x);
  for (int i = 0; i < Q.size(); i++) {
    if (i == 0 || i == (int)Q.size() - 1)
      pos.insert(Q[i]);
    else {
      if ((Q[i - 1].second - Q[i].second) * 1ll *
              (Q[i + 1].first - Q[i].first) * Q[i - 1].first *
              Q[i + 1].second <=
          (Q[i].second - Q[i + 1].second) * 1ll *
              (Q[i].first - Q[i - 1].first) * Q[i + 1].first * Q[i - 1].second)
        pos.insert(Q[i]);
    }
  }
  sort(answer.begin(), answer.end());
  for (int i = 0; i < answer.size(); i++)
    if (pos.find(make_pair(B[answer[i]].a, B[answer[i]].b)) != pos.end())
      printf("%d ", answer[i]);
  printf("\n");
  return 0;
}
