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>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const double eps = 1e-16;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  if (n < 0) {
    long long res = mod_pow(x, -n, m);
    return mod_pow(res, m - 2, m);
  }
  if (abs(x) >= m) x %= m;
  if (x < 0) x += m;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) {
  a = a / b;
  return a;
}
const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[a - b];
}
double dot(pair<double, double> a, pair<double, double> b) {
  return a.first * b.first + a.second * b.second;
}
double cross(pair<double, double> a, pair<double, double> b) {
  return a.first * b.second - a.second * b.first;
}
double norm(pair<double, double> a) {
  return sqrtl(a.first * a.first + a.second * a.second);
}
pair<double, double> operator+(const pair<double, double>& a,
                               const pair<double, double>& b) {
  return {a.first + b.first, a.second + b.second};
}
pair<double, double> operator-(const pair<double, double>& a,
                               const pair<double, double>& b) {
  return {a.first - b.first, a.second - b.second};
}
pair<double, double> operator-=(pair<double, double>& a,
                                const pair<double, double> b) {
  a = a - b;
  return a;
}
double abs(pair<double, double> a) { return norm(a); }
pair<double, double> operator*(const pair<double, double>& a, const double& b) {
  return {a.first * b, a.second * b};
}
pair<double, double> operator/(const pair<double, double>& a, const double& b) {
  return {a.first / b, a.second / b};
}
struct Line {
  pair<double, double> a, b;
};
struct Circle {
  pair<double, double> p;
  double r;
};
int ccw(pair<double, double> a, pair<double, double> b,
        pair<double, double> c) {
  b -= a;
  c -= a;
  if (cross(b, c) > eps) return 1;
  if (cross(b, c) < -eps) return -1;
  if (dot(b, c) < 0) return 2;
  if (norm(b) < norm(c)) return -2;
  return 0;
}
void solve() {
  int n;
  cin >> n;
  vector<pair<double, double> > p(n);
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    p[i] = {1 / (double)x, 1 / (double)y};
  }
  vector<pair<double, double> > cop = p;
  sort((p).begin(), (p).end());
  vector<pair<double, double> > vp;
  for (int i = 0; i < p.size(); i++) {
    if (i > 0 && p[i - 1].first == p[i].first) continue;
    if (vp.size() && vp.back().second <= p[i].second) continue;
    int len = vp.size();
    while (len >= 2 && ccw(vp[len - 2], vp[len - 1], p[i]) == -1) {
      vp.pop_back();
      len--;
    }
    vp.push_back(p[i]);
  }
  vector<int> ans;
  for (int i = 0; i < cop.size(); i++) {
    int id = lower_bound((vp).begin(), (vp).end(), cop[i]) - vp.begin();
    if (id < vp.size() && vp[id] == cop[i]) {
      ans.push_back(i);
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    if (i > 0) cout << " ";
    cout << ans[i] + 1;
  }
  cout << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
