#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct point_comp {
  bool operator()(const complex<double> &a, const complex<double> &b) const {
    if (a.real() == b.real()) return a.imag() < b.imag();
    return a.real() < b.real();
  }
} mycomp;
inline double cross(const complex<double> &a, const complex<double> &b) {
  return imag(conj(a) * b);
}
inline double cross(const complex<double> &c, const complex<double> &a,
                    const complex<double> &b) {
  return cross(a - c, b - c);
}
vector<complex<double> > ConvexHull(vector<complex<double> > &P) {
  sort(P.begin(), P.end(), mycomp);
  int n = P.size();
  if (n < 3) return P;
  int sz = 0;
  vector<complex<double> > H(2 * n);
  for (int i = 0; i < n; i++) {
    while (sz >= 2 && cross(H[sz - 2], H[sz - 1], P[i]) <= 0) {
      --sz;
    }
    H[sz++] = P[i];
  }
  for (int i = n - 2, k = sz + 1; i >= 0; --i) {
    while (sz >= k && cross(H[sz - 2], H[sz - 1], P[i]) <= 0) {
      --sz;
    }
    H[sz++] = P[i];
  }
  H.resize(sz - 1);
  return H;
}
int main() {
  int n;
  scanf("%d", &n);
  vector<complex<double> > P(n);
  map<complex<double>, vector<int>, point_comp> ind;
  int sz = 0;
  for (int i = 0; i < n; i++) {
    double s, r;
    scanf("%lf%lf", &s, &r);
    complex<double> pt = complex<double>(1.0 / s, 1.0 / r);
    if (!ind.count(pt)) P[sz++] = pt;
    ind[pt].push_back(i + 1);
  }
  P.resize(sz);
  vector<complex<double> > H = ConvexHull(P);
  vector<int> ans;
  int cur = 0;
  do {
    vector<int> &ref = ind[H[cur]];
    ans.insert(ans.end(), ref.begin(), ref.end());
    cur++;
  } while (cur < H.size() && H[cur - 1].imag() > H[cur].imag());
  sort(ans.begin(), ans.end());
  for (int x : ans) printf("%d ", x);
  return 0;
}
