#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long double eps = 1e-32;
int n, ans[N], cntans;
struct node {
  long double x, y;
  vector<int> id;
  node(long double rx = 0, long double ry = 0) {
    x = rx;
    y = ry;
  }
  bool operator<(const node& rhs) const {
    return x != rhs.x ? x < rhs.x : y < rhs.y;
  }
  node operator-(const node& rhs) const { return node(x - rhs.x, y - rhs.y); }
  long double operator^(const node& rhs) const { return x * rhs.y - y * rhs.x; }
} nd[N];
node stdw[N];
long double cross(node u, node v, node w) { return (v - u) ^ (w - v); }
int tpdw;
long double mn;
bool dwempty() { return tpdw < 2; }
int main() {
  scanf("%d", &n);
  for (int i = 1, u, v; i <= n; i++) {
    scanf("%d%d", &u, &v);
    nd[i] = node(1e5 / u, 1e5 / v);
    nd[i].id.push_back(i);
  }
  sort(nd + 1, nd + n + 1);
  stdw[++tpdw] = nd[1];
  mn = nd[1].y;
  for (int i = 2; i <= n; i++) {
    if (fabs(nd[i].x - stdw[tpdw].x) <= eps &&
        fabs(nd[i].y - stdw[tpdw].y) <= eps) {
      stdw[tpdw].id.push_back(nd[i].id[0]);
      continue;
    }
    if (nd[i].y >= mn) {
      continue;
    }
    mn = nd[i].y;
    while (!dwempty() && cross(stdw[tpdw - 1], stdw[tpdw], nd[i]) <= eps) {
      --tpdw;
    }
    stdw[++tpdw] = nd[i];
  }
  for (int i = 1; i <= tpdw; i++) {
    for (int j = 0; j < (int)stdw[i].id.size(); j++) {
      ans[++cntans] = stdw[i].id[j];
    }
  }
  sort(ans + 1, ans + cntans + 1);
  for (int i = 1; i <= cntans; i++) {
    printf("%d%c", ans[i], " \n"[i == cntans]);
  }
  return 0;
}
