#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
struct node {
  double r, s;
  bool operator<(const node& a) const { return r == a.r ? s > a.s : r > a.r; }
} a[N], d[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    d[i] = a[i] = {(double)x, (double)y};
  }
  sort(a, a + n);
  vector<node> v, p;
  for (int i = 0, s = 0, r = 0; i < n; i++) {
    if (a[i].s > s) s = a[i].s, p.push_back(a[i]);
  }
  for (int i = p.size() - 1; i >= 0; i--) {
    function<bool(node, node, node)> cmp = [](node a, node b, node c) {
      function<double(node, node)> slope = [](node a, node b) {
        return (b.r - a.r) / (a.r * b.r) / ((a.s - b.s) / (a.s * b.s));
      };
      return slope(a, b) < slope(b, c);
    };
    while (v.size() > 1 && cmp(v.end()[-2], v.end()[-1], p[i])) v.pop_back();
    v.push_back(p[i]);
  }
  set<node> s;
  for (auto d : v) s.insert(d);
  for (int i = 0; i < n; i++)
    if (s.count(d[i])) printf("%d ", i + 1);
  puts("");
  return 0;
}
