#include <bits/stdc++.h>
using namespace std;
struct Node {
  int x, y, idx;
} p[200005];
bool che(Node A, Node B, Node C) {
  return 1ll * (C.x - B.x) * (A.y - B.y) * C.y * A.x <
         1ll * (A.x - B.x) * (C.y - B.y) * A.y * C.x;
}
Node v[200005];
bool cmp(Node A, Node B) { return A.x < B.x || A.x == B.x && A.y < B.y; }
int n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    p[i].idx = i;
  }
  sort(p + 1, p + n + 1, cmp);
  int tail = 0;
  for (int i = 1; i <= n; i++) {
    while (1 <= tail && v[tail].y <= p[i].y) tail--;
    while (1 < tail && che(p[i], v[tail], v[tail - 1])) tail--;
    v[++tail] = p[i];
  }
  set<pair<int, int> > q;
  for (int i = 1; i <= tail; i++) q.insert(make_pair(v[i].x, v[i].y));
  vector<int> ans;
  for (int i = 1; i <= n; i++)
    if (q.count(make_pair(p[i].x, p[i].y))) ans.push_back(p[i].idx);
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  return 0;
}
