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;
struct info {
  int s, r, id;
  info(int s = 0, int r = 0, int id = 0) : s(s), r(r), id(id) {}
  bool operator<(const info& b) const {
    if (s != b.s) return s < b.s;
    return r > b.r;
  }
};
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long myabs(long long x) { return x > 0 ? x : -x; }
struct fract {
  long long n, d;
  fract(long long num = 0, long long den = 1) {
    assert(0 < den && den < 100000000000000000LL);
    long long g = gcd(myabs(num), myabs(den));
    n = num / g;
    d = den / g;
  }
  fract operator+(const fract& b) const {
    return fract(n * b.d + d * b.n, d * b.d);
  }
  fract operator-(const fract& b) const {
    return fract(n * b.d - d * b.n, d * b.d);
  }
  fract operator*(const fract& b) const { return fract(n * b.n, d * b.d); }
};
struct point {
  fract x, y;
  point(fract x = 0, fract y = 0) : x(x), y(y) {}
  point operator+(const point& b) const { return point(x + b.x, y + b.y); }
  point operator-(const point& b) const { return point(x - b.x, y - b.y); }
  fract cross(const point& b) const { return x * b.y - y * b.x; }
};
bool isConvex(int r1, int s1, int r2, int s2, int r3, int s3) {
  point A(fract(r2 - r1, r2), fract(s2 - s1, s2));
  point B(fract(r3 - r1, r3), fract(s3 - s1, s3));
  return (A.cross(B).n >= 0);
}
bool isPositive(int r1, int s1, int r2, int s2) {
  assert(s2 > s1);
  return (r2 - r1) * (s2 - s1) < 0;
}
int main() {
  int n;
  scanf("%d", &n);
  vector<info> runner(n);
  map<pair<int, int>, vector<int> > id;
  for (int i = 0; i < (n); i++) {
    scanf("%d%d", &runner[i].s, &runner[i].r);
    runner[i].id = i + 1;
    id[make_pair(runner[i].s, runner[i].r)].push_back(i + 1);
  }
  sort(runner.begin(), runner.end());
  vector<info> v;
  for (int i = 0; i < (n); i++) {
    if (i == 0 || runner[i - 1].s != runner[i].s) v.push_back(runner[i]);
  }
  runner = v;
  n = v.size();
  for (int i = 0; i < (n); i++) swap(runner[i].s, runner[i].r);
  sort(runner.begin(), runner.end());
  v.clear();
  for (int i = 0; i < (n); i++) {
    if (i == 0 || runner[i - 1].s != runner[i].s) v.push_back(runner[i]);
  }
  for (int i = 0; i < (n); i++) swap(runner[i].s, runner[i].r);
  sort(runner.begin(), runner.end());
  vector<info> st;
  for (int i = 0; i < (v.size()); i++) {
    info cur = v[i];
    int k = st.size();
    while (k >= 2 && !isConvex(st[k - 2].r, st[k - 2].s, st[k - 1].r,
                               st[k - 1].s, cur.r, cur.s)) {
      st.pop_back();
      k = st.size();
    }
    while (k >= 1 && !isPositive(st[k - 1].r, st[k - 1].s, cur.r, cur.s)) {
      st.pop_back();
      k = st.size();
    }
    st.push_back(cur);
  }
  vector<int> res;
  for (int i = 0; i < (st.size()); i++) {
    vector<int>& cv = id[make_pair(st[i].r, st[i].s)];
    for (vector<int>::iterator it = cv.begin(); it != cv.end(); it++)
      res.push_back(*it);
  }
  sort(res.begin(), res.end());
  for (int i = 0; i < (res.size()); i++) printf("%d ", res[i]);
  puts("");
  return 0;
}
