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>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const int INF = 1000000000;
const int MAX = 1000007;
const int MAX2 = 7000;
const int BASE = 1000000000;
const long long INF2 = 10000000000000007LL;
const int MOD = 1000000007;
map<pair<int, int>, vector<int> > ids;
vector<pair<int, int> > a;
bool ccw(pair<int, int> A, pair<int, int> B, pair<int, int> C) {
  long long R1 =
      1LL * (A.first - B.first) * (B.second - C.second) * A.second * C.first;
  long long R2 =
      1LL * (A.second - B.second) * (B.first - C.first) * A.first * C.second;
  return R1 < R2;
}
bool Comp(pair<int, int> a, pair<int, int> b) {
  return a.first > b.first || (a.first == b.first && a.second > b.second);
}
int main() {
  int n;
  cin >> n;
  for (int i = (0); i < (n); ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    a.push_back(make_pair(x, y));
    ids[make_pair(x, y)].push_back(i);
  }
  sort(a.begin(), a.end(), Comp);
  a.resize(unique(a.begin(), a.end()) - a.begin());
  vector<pair<int, int> > b;
  b.push_back(a[0]);
  for (int i = (1); i < (a.size()); ++i) {
    if (a[i].second <= b.back().second) continue;
    while (b.size() >= 2 && ccw(b[b.size() - 2], b[b.size() - 1], a[i])) {
      b.pop_back();
    }
    b.push_back(a[i]);
  }
  vector<int> res;
  for (int i = (0); i < (b.size()); ++i) {
    vector<int> v = ids[b[i]];
    for (int j = (0); j < (v.size()); ++j) {
      res.push_back(v[j] + 1);
    }
  }
  sort(res.begin(), res.end());
  for (int i = (0); i < (res.size()); ++i) {
    printf("%d ", res[i]);
  }
  cout << endl;
  return 0;
}
