#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
struct node {
  int x, y;
  bool operator<(const node &a) const {
    if (x == a.x) return y < a.y;
    return x < a.x;
  }
} p[MAXN], stk[MAXN];
int call(node a, node b, node c) {
  return (long long)(b.y - a.y) * (c.x - b.x) * c.y * a.x >
         (long long)(c.y - b.y) * (b.x - a.x) * a.y * c.x;
}
set<pair<int, int> > st;
pair<int, int> b[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    b[i] = make_pair(p[i].x, p[i].y);
  }
  sort(p + 1, p + n + 1);
  int sz = 0;
  for (int i = 1; i <= n; i++) {
    if (p[i].x != p[i + 1].x) stk[++sz] = p[i];
  }
  memcpy(p, stk, sizeof(stk));
  int top = 0;
  for (int i = 1; i <= sz; i++) {
    while (top > 1 && call(p[i], stk[top - 1], stk[top - 2])) {
      top--;
    }
    if (top == 0 || top > 1)
      stk[top++] = p[i];
    else {
      if (p[i].y >= stk[0].y)
        stk[0] = p[i];
      else
        stk[top++] = p[i];
    }
  }
  for (int i = 0; i < top; i++) st.insert(make_pair(stk[i].x, stk[i].y));
  for (int i = 1; i <= n; i++)
    if (st.count(b[i])) printf("%d ", i);
  printf("\n");
  return 0;
}
