#include <bits/stdc++.h>
using namespace std;
double eps = 1e-20;
int n, m;
struct Point {
  int x, y;
  int i;
};
int cmp(const Point &p1, const Point &p2) {
  return p1.x < p2.x || (p1.x == p2.x && p1.y < p2.y);
}
int cmp2(const Point &p1, const Point &p2) { return p1.i < p2.i; }
double inter(Point &p1, Point &p2) {
  return (p2.y - p1.y) * (p1.x - p2.x) <= 0;
}
int judge(Point &p1, Point &p2, Point &p3) {
  return (long long)(p2.y - p1.y) * (p2.x - p3.x) * p1.x * p3.y -
             (long long)(p3.y - p2.y) * (p1.x - p2.x) * p3.x * p1.y <
         0;
}
Point p[1000000];
int ans[1000000];
map<pair<int, int>, vector<int> > ft;
int main() {
  while (cin >> n) {
    vector<Point> nima;
    for (int i = 0; i < n; ++i) {
      Point pt;
      cin >> pt.x >> pt.y;
      pt.i = i;
      if (ft[make_pair(pt.x, pt.y)].size() == 0) {
        nima.push_back(pt);
      }
      ft[make_pair(pt.x, pt.y)].push_back(i);
    }
    sort(nima.begin(), nima.end(), cmp);
    int top = 0;
    for (int i = 0; i < nima.size(); ++i) {
      if (!(nima[i].x == p[top - 1].x && nima[i].y == p[top - 1].y)) {
        while (top > 0 &&
               ((nima[i].x == p[top - 1].x && nima[i].y > p[top - 1].y) ||
                inter(nima[i], p[top - 1])))
          --top;
        while (top > 1 && judge(nima[i], p[top - 1], p[top - 2])) --top;
      }
      p[top++] = nima[i];
    }
    int m = 0;
    for (int i = 0; i < top; ++i) {
      vector<int> &kao = ft[make_pair(p[i].x, p[i].y)];
      for (int j = 0; j < kao.size(); ++j) {
        ans[m++] = kao[j];
      }
    }
    sort(ans, ans + m);
    for (int i = 0; i < m; ++i) cout << ans[i] + 1 << " ";
    cout << endl;
  }
}
