#include <bits/stdc++.h>
inline int read() {
  int data = 0, w = 1;
  char ch = getchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') w = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
  return data * w;
}
const int maxn(3e5 + 10);
int q[maxn], top, next[maxn], ok[maxn], n;
struct point {
  int x, y, id;
} p[maxn];
double k[maxn];
inline bool operator<(const point &lhs, const point &rhs) {
  return lhs.x > rhs.x || (lhs.x == rhs.x && lhs.y > rhs.y);
}
inline double slope(const point &i, const point &j) {
  return 1. * i.x * j.x * (j.y - i.y) / (1. * i.y * j.y * (j.x - i.x));
}
int main() {
  n = read();
  int minx, miny = 0;
  for (register int i = 1; i <= n; i++) {
    p[i] = (point){read(), read(), i};
    if (miny < p[i].y || (miny == p[i].y && minx < p[i].x))
      minx = p[i].x, miny = p[i].y;
  }
  std::sort(p + 1, p + n + 1);
  q[top = 1] = 1;
  for (register int i = 2; i <= n && minx <= p[i].x; i++) {
    if (p[q[top]].x == p[i].x) {
      if (p[q[top]].y == p[i].y)
        next[p[i].id] = next[p[q[top]].id], next[p[q[top]].id] = p[i].id;
      continue;
    }
    while (top > 1 && k[top] > slope(p[q[top]], p[i])) --top;
    q[++top] = i;
    k[top] = slope(p[q[top - 1]], p[i]);
  }
  for (register int i = top; i; --i)
    for (register int j = p[q[i]].id; j; j = next[j]) ok[j] = 1;
  for (register int i = 1; i <= n; i++)
    if (ok[i]) printf("%d ", i);
  return 0;
}
