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 main() {
  int n;
  cin >> n;
  vector<int> s(n), r(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i] >> r[i];
  }
  vector<tuple<int, int, int>> T(n);
  for (int i = 0; i < n; i++) {
    T[i] = make_tuple(s[i], r[i], i);
  }
  sort(T.begin(), T.end(), greater<tuple<int, int, int>>());
  vector<int> id(n);
  for (int i = 0; i < n; i++) {
    s[i] = get<0>(T[i]);
    r[i] = get<1>(T[i]);
    id[i] = get<2>(T[i]);
  }
  int mx = -1, ms = -1;
  vector<int> s2, r2, id2;
  int n2 = 0;
  for (int i = 0; i < n; i++) {
    if (r[i] > mx || r[i] == mx && s[i] == ms) {
      mx = r[i];
      ms = s[i];
      s2.push_back(s[i]);
      r2.push_back(r[i]);
      id2.push_back(id[i]);
      n2++;
    }
  }
  vector<int> ans;
  ans.push_back(id2[0]);
  for (int i = 1; i < n2 - 1; i++) {
    long long A = (long long)s2[i + 1] * r2[i - 1] * (r2[i] - r2[i + 1]) *
                  (s2[i] - s2[i - 1]);
    long long B = (long long)s2[i - 1] * r2[i + 1] * (r2[i - 1] - r2[i]) *
                  (s2[i + 1] - s2[i]);
    if (A <= B) {
      ans.push_back(id2[i]);
    }
  }
  if (n2 > 1) {
    ans.push_back(id2[n2 - 1]);
  }
  sort(ans.begin(), ans.end());
  int cnt = ans.size();
  for (int i = 0; i < cnt; i++) {
    cout << ans[i] + 1;
    if (i < cnt - 1) {
      cout << ' ';
    }
  }
  cout << endl;
}
