#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, vis[N], ans[N];
vector<int> vec;
struct pos {
  int bh, sbh;
  long long x, y;
} p[N], st[N], tmp;
bool cmp(pos a, pos b) { return (a.x == b.x) ? a.y > b.y : a.x > b.x; }
long double check(pos a, pos b) {
  return (long double)a.x * b.x * (b.y - a.y) / (b.x - a.x) / a.y / b.y;
}
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++)
    scanf("%lld", &p[i].x), scanf("%lld", &p[i].y), p[i].bh = i;
  sort(p + 1, p + n + 1, cmp);
  for (int i = 1; i <= n; i++) p[i].sbh = i;
  int top = 1;
  st[1] = p[1];
  long long maxy = st[1].y;
  for (int i = 2; i <= n; i++) (p[i].y <= maxy) ? vis[i] = 1 : maxy = p[i].y;
  for (int i = 2; i <= n; i++) {
    if (vis[i] || check(p[i], st[top]) > 0) continue;
    while (top > 1 && check(p[i], st[top]) < check(st[top - 1], st[top])) top--;
    st[++top] = p[i];
  }
  for (int i = 1; i <= top; i++) {
    ans[st[i].bh] = 1;
    for (int j = st[i].sbh + 1; j <= n; j++) {
      if (p[j].x != st[i].x || p[j].y != st[i].y) break;
      ans[p[j].bh] = 1;
    }
  }
  for (int i = 1; i <= n; i++)
    if (ans[i]) printf("%d ", i);
  return 0;
}
