#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
struct dv {
  long long so, mo;
  dv() {}
  dv(long long so, long long mo) {
    this->so = so;
    this->mo = mo;
  }
  dv operator-(dv a) const {
    dv t;
    t.mo = lcm(mo, a.mo);
    t.so = t.mo / mo * so - t.mo / a.mo * a.so;
    long long tt = gcd(abs(t.mo), abs(t.so));
    t.mo /= tt;
    t.so /= tt;
    return t;
  }
  dv operator*(dv a) const {
    dv t;
    t.so = a.so * so;
    t.mo = a.mo * mo;
    long long tt = gcd(abs(t.so), abs(t.mo));
    t.mo /= tt;
    t.so /= tt;
    return t;
  }
};
struct point {
  int id;
  dv x, y;
  point() {}
  point(dv x, dv y) {
    this->x = x;
    this->y = y;
  }
  point operator-(point a) { return point(x - a.x, y - a.y); }
  dv operator/(point a) { return x * a.y - y * a.x; }
  bool operator<(point a) const {
    return x.mo != a.x.mo ? x.mo > a.x.mo : y.mo > a.y.mo;
  }
};
bool praword(point a, point b, point c) {
  return 1LL * a.y.mo * b.x.mo * c.x.mo * c.y.mo +
             1LL * a.x.mo * a.y.mo * b.y.mo * c.x.mo +
             1LL * a.x.mo * b.x.mo * b.y.mo * c.y.mo -
             (1LL * a.x.mo * a.y.mo * b.x.mo * c.y.mo +
              1LL * a.x.mo * b.y.mo * c.x.mo * c.y.mo +
              1LL * a.y.mo * b.x.mo * b.y.mo * c.x.mo) <
         0;
}
int covexhull(point p[], int n, point ch[]) {
  sort(p, p + n);
  int m = 0;
  for (int i = 0; i < n; i++) {
    if (m > 0 && p[i].y.mo <= ch[m - 1].y.mo) continue;
    while (m > 1 && praword(ch[m - 2], ch[m - 1], p[i])) m--;
    ch[m++] = p[i];
  }
  return m;
}
point bx[200010], ch[200010];
vector<int> ans;
map<pair<long long, long long>, vector<int> > mp;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    bx[i].id = i;
    bx[i].x.so = bx[i].y.so = 1;
    bx[i].x.mo = a;
    bx[i].y.mo = b;
    mp[pair<long long, long long>(a, b)].push_back(i);
  }
  n = covexhull(bx, n, ch);
  for (int i = 0; i < n; i++) {
    vector<int>& vc = mp[pair<long long, long long>(ch[i].x.mo, ch[i].y.mo)];
    int len = vc.size();
    for (int j = 0; j < len; j++) ans.push_back(vc[j]);
    mp.erase(pair<long long, long long>(ch[i].x.mo, ch[i].y.mo));
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i] + 1);
}
