#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
struct Point {
  double x, y;
  int id;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  Point operator-(const Point& o) const { return Point(x - o.x, y - o.y); }
  bool operator<(const Point& o) const {
    return x < o.x - 1e-9 || (x < o.x + 1e-9 && y < o.y - 1e-9);
  }
  double cross(Point b) const { return x * b.y - b.x * y; }
};
int s[200105], r[200105];
Point p[200105];
vector<Point> ans;
map<pair<int, int>, vector<int>> mp;
int main() {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    scanf("%d%d", s + i, r + i);
    p[i].x = 1e4 / s[i];
    p[i].y = 1e4 / r[i];
    p[i].id = i;
    mp[{s[i], r[i]}].push_back(i + 1);
  }
  sort(p, p + n);
  ans.push_back(p[0]);
  for (int i = 1; i < n; i++) {
    if (p[i].y < ans.back().y - 1e-9) {
      while (ans.size() > 1) {
        Point x = ans.back() - ans[ans.size() - 2];
        Point y = p[i] - ans[ans.size() - 2];
        if (x.cross(y) < -1e-9)
          ans.pop_back();
        else
          break;
      }
      ans.push_back(p[i]);
    }
  }
  set<int> v;
  for (auto x : ans) {
    for (int id : mp[{s[x.id], r[x.id]}]) v.insert(id);
  }
  for (int c : v) printf("%d ", c);
  return 0;
}
