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 
#include <bits/stdc++.h>
using namespace std;
int sgn(int x) {
  if (x < 0) return -1;
  if (x == 0) return 0;
  return 1;
}
struct Frac {
  __int128 up;
  __int128 dw;
  Frac() {
    up = 0;
    dw = 1;
  }
  Frac(__int128 up_, __int128 dw_) {
    up = up_;
    dw = dw_;
    assert(dw > 0);
  }
  bool operator<(const Frac &other) const {
    __int128 a = up;
    __int128 b = dw;
    __int128 x = other.up;
    __int128 y = other.dw;
    return a * y < x * b;
  }
  bool operator==(const Frac &other) const {
    return (up * other.dw == other.up * dw);
  }
  Frac operator-(const Frac &other) const {
    __int128 a = up;
    __int128 b = dw;
    __int128 x = other.up;
    __int128 y = other.dw;
    return Frac(a * y - x * b, b * y);
  }
  Frac operator+(const Frac &other) const {
    __int128 a = up;
    __int128 b = dw;
    __int128 x = other.up;
    __int128 y = other.dw;
    return Frac(a * y + x * b, b * y);
  }
  Frac operator*(const Frac &other) const {
    __int128 a = up;
    __int128 b = dw;
    __int128 x = other.up;
    __int128 y = other.dw;
    return Frac(a * x, b * y);
  }
};
struct Point {
  Frac x;
  Frac y;
  Point() {}
  Point(Frac x_, Frac y_) {
    x = x_;
    y = y_;
  }
  Point operator-(const Point &other) const {
    return Point(x - other.x, y - other.y);
  }
  Frac operator*(const Point &other) const { return x * other.y - y * other.x; }
  Frac dist(const Point &other) const {
    Frac dx = x - other.x;
    Frac dy = y - other.y;
    return dx * dy + dy * dy;
  }
  bool operator<(const Point &other) const {
    if (x == other.x) {
      return y < other.y;
    } else {
      return x < other.x;
    }
  }
  bool operator==(const Point &other) const {
    return x == other.x && y == other.y;
  }
};
const Frac ZR = Frac(0, 1);
const Frac INF = Frac(1e4, 1);
vector<int> solve(vector<Point> a) {
  int n = (int)a.size();
  int to = min_element(a.begin(), a.end()) - a.begin();
  Point lf = a[to];
  vector<int> ind;
  for (int i = 0; i < n; i++) {
    if (i != to) {
      ind.push_back(i);
    }
  }
  auto cmp = [&](int i, int j) {
    Point f = (a[i] - lf);
    Point s = (a[j] - lf);
    Frac ml = f * s;
    if (ml == ZR) {
      if (a[i].x == a[j].x) {
        return a[i].y < a[j].y;
      } else {
        return a[i].x < a[j].x;
      }
    } else {
      return ZR < ml;
    }
  };
  sort(ind.begin(), ind.end(), cmp);
  auto can = [&](int i, int j, int k) {
    Point f = (a[j] - a[i]);
    Point s = (a[k] - a[j]);
    if (f * s < ZR) {
      return 0;
    } else {
      return 1;
    }
  };
  vector<int> st = {to};
  for (auto k : ind) {
    while ((int)st.size() >= 2) {
      if (can(st.rbegin()[1], st.rbegin()[0], k)) {
        break;
      } else {
        st.pop_back();
      }
    }
    st.push_back(k);
  }
  return st;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cerr << fixed << setprecision(6);
  int n;
  cin >> n;
  vector<Point> a(n);
  for (auto &t : a) {
    int r, s;
    cin >> s >> r;
    t = Point(Frac(1, s), Frac(1, r));
  }
  vector<Point> na = a;
  sort(na.begin(), na.end());
  na.resize(unique(na.begin(), na.end()) - na.begin());
  map<Point, vector<int>> rp;
  for (int i = 0; i < n; i++) {
    rp[a[i]].push_back(i);
  }
  auto ch = solve(na);
  Frac min_y = INF;
  for (int i = 0; i < (int)ch.size(); i++) {
    if (na[ch[i]].y < min_y) {
      min_y = na[ch[i]].y;
    }
  }
  Frac min_x = INF;
  for (int i = 0; i < (int)ch.size(); i++) {
    if (na[ch[i]].y == min_y && na[ch[i]].x < min_x) {
      min_x = na[ch[i]].x;
    }
  }
  int w = -1;
  for (int i = 0; i < (int)ch.size(); i++) {
    if (na[ch[i]].y == min_y && na[ch[i]].x == min_x) {
      w = i;
    }
  }
  vector<Point> ans;
  for (int i = 0; i <= w; i++) {
    ans.push_back(na[ch[i]]);
  }
  vector<int> res;
  for (auto p : ans) {
    for (auto ind : rp[p]) {
      res.push_back(ind);
    }
  }
  sort(res.begin(), res.end());
  for (auto x : res) {
    cout << x + 1 << ' ';
  }
  cout << '\n';
}
