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;
const double eps = 1e-22;
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> coordinate() { return {X, Y}; }
};
int n;
map<pair<int, int>, vector<int> > mp;
point d, l;
vector<point> v;
vector<point> hull;
inline bool downcmp(const point& a, const point& b) {
  return make_pair(a.y, a.x) < make_pair(b.y, b.x);
}
inline bool leftcmp(const point& a, const point& b) {
  return make_pair(a.x, a.y) < make_pair(b.x, b.y);
}
inline bool anglecmp(const point& a, const point& b) {
  double cross = ((point)a - d) * ((point)b - d);
  if (fabs(cross) <= eps) return d.dis(a) < d.dis(b);
  return cross < eps;
}
int main(int argc, const char* argv[]) {
  ios::sync_with_stdio(0);
  int i;
  cin >> n;
  for (i = 1; i <= n; i++) {
    int a, b;
    cin >> a >> b, mp[{a, b}].push_back(i);
  }
  if (mp.size() == 1) {
    for (i = 1; i <= n; i++) cout << i << " ";
    cout << endl;
    return 0;
  }
  for (pair<pair<int, int>, vector<int> > q : mp) {
    pair<int, int> p = q.first;
    int x = p.first, y = p.second;
    point P;
    P.init(x, y), v.push_back(P);
  }
  d = *min_element(v.begin(), v.end(), downcmp);
  l = *min_element(v.begin(), v.end(), leftcmp);
  if (d.coordinate() == l.coordinate()) {
    for (int a : mp[d.coordinate()]) {
      cout << a << " ";
    }
    cout << endl;
    return 0;
  }
  sort(v.begin(), v.end(), anglecmp);
  int po = 2;
  for (i = 0; i < po; i++) hull.push_back(v[i]);
  vector<int> ans;
  while (po < v.size() && hull.back().coordinate() != l.coordinate()) {
    while (hull.size() > 1 && ((hull[hull.size() - 1] - hull[hull.size() - 2]) *
                                   (v[po] - hull[hull.size() - 2]) >
                               eps))
      hull.pop_back();
    hull.push_back(v[po++]);
  }
  for (point p : hull) {
    for (int a : mp[p.coordinate()]) ans.push_back(a);
  }
  sort(ans.begin(), ans.end());
  for (int a : ans) cout << a << " ";
  cout << endl;
  return 0;
}
