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;
struct point {
  int X, Y;
  double x, y;
  point() { X = Y = x = y = .0; }
  point(double a, double b) { x = a, y = b; }
  inline void init(int a, int b) {
    X = a, Y = b;
    x = 1.0 / X;
    y = 1.0 / Y;
  }
  inline double operator*(point p) { return x * p.y - y * p.x; }
  inline point operator-(point p) { return point(x - p.x, y - p.y); }
  inline double dis(point p) {
    return ((x - p.x) * (x - p.x)) + ((y - p.y) * (y - p.y));
  }
  inline pair<int, int> PII() { return pair<int, int>(X, Y); }
};
point o;
point l;
inline bool ocmp(const point &a, const point &b) {
  return make_pair(a.y, a.x) < make_pair(b.y, b.x);
}
inline bool lcmp(const point &a, const point &b) {
  return make_pair(a.x, a.y) < make_pair(b.x, b.y);
}
inline bool scmp(const point &a, const point &b) {
  double cross = ((point)a - o) * ((point)b - o);
  if (fabs(cross) <= 1e-18) return o.dis(a) < o.dis(b);
  return cross < 1e-18;
}
vector<point> v;
vector<point> hull;
map<pair<int, int>, vector<int>> indx;
void CH() {
  o = *min_element(v.begin(), v.end(), ocmp);
  l = *min_element(v.begin(), v.end(), lcmp);
  if (o.PII() == l.PII()) {
    for (int p : indx[o.PII()]) {
      cout << p << " ";
    }
    cout << endl;
    return;
  }
  sort(v.begin(), v.end(), scmp);
  if ((int)v.size() == 1) {
    hull.push_back(v.front());
    return;
  }
  for (int i = 0; i < 2; i++) hull.push_back(v[i]);
  int po = 2;
  while (po < (int)v.size() && hull.back().PII() != l.PII()) {
    while (hull.size() > 1 && (hull[hull.size() - 1] - hull[hull.size() - 2]) *
                                      (v[po] - hull[hull.size() - 2]) >
                                  1e-18)
      hull.pop_back();
    hull.push_back(v[po++]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    indx[make_pair(x, y)].push_back(i + 1);
  }
  if ((int)indx.size() == 1) {
    for (auto p : indx) {
      for (int x : p.second) cout << x << " ";
      cout << endl;
    }
    return 0;
  }
  for (auto p : indx) {
    int x = p.first.first;
    int y = p.first.second;
    point P;
    P.init(x, y);
    v.push_back(P);
  }
  CH();
  vector<int> ans;
  for (point p : hull) {
    for (int x : indx[p.PII()]) {
      ans.push_back(x);
    }
  }
  sort(ans.begin(), ans.end());
  for (int x : ans) cout << x << " ";
  cout << endl;
}
