#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return f * x;
}
const long long maxn = 3e5 + 5;
long long n, tot, ca[maxn];
struct node {
  long long a, b, id;
  bool friend operator<(node x, node y) {
    return x.a == y.a ? x.b > y.b : x.a > y.a;
  }
} p[maxn], t[maxn];
long long pos[maxn];
long long sta[maxn], top;
inline double cal(long long x, long long y) {
  return 1.0 * t[x].a * t[y].a * (t[y].b - t[x].b) /
         (1.0 * t[x].b * t[y].b * (t[y].a - t[x].a));
}
signed main() {
  n = read();
  for (long long i = 1; i <= n; ++i)
    p[i].a = read(), p[i].b = read(), p[i].id = i;
  sort(p + 1, p + n + 1);
  long long max_b = p[1].b;
  t[++tot] = p[1];
  pos[1] = 1;
  for (long long i = 2; i <= n; ++i) {
    if (p[i].b <= max_b) continue;
    max_b = max(max_b, p[i].b);
    t[++tot] = p[i];
    pos[tot] = i;
  }
  sta[1] = 1, sta[2] = 2;
  top = 2;
  for (long long i = 3; i <= tot; ++i) {
    while (top > 1 && cal(sta[top], i) < cal(sta[top - 1], sta[top])) --top;
    sta[++top] = i;
  }
  for (long long i = 1; i <= top; ++i) {
    long long nw = sta[i];
    long long ta = t[nw].a, tb = t[nw].b;
    for (long long j = pos[nw]; j <= n; ++j)
      if (p[j].a == ta && p[j].b == tb)
        ca[p[j].id] = 1;
      else
        break;
  }
  for (long long i = 1; i <= n; ++i)
    if (ca[i]) printf("%lld ", i);
  return 0;
}
