#include <bits/stdc++.h>
using namespace std;
struct po {
  long double x, y;
  void read() {
    double x0, y0;
    scanf("%lf%lf", &x0, &y0);
    x = 1. / x0, y = 1. / y0;
  }
  inline int operator<(const po &A) const {
    if (x == A.x) return y > A.y;
    return x < A.x;
  }
  po operator-(const po &A) const { return (po){x - A.x, y - A.y}; }
  long double operator*(const po &A) const { return x * A.y - y * A.x; }
  bool operator==(const po &A) const { return (A.x == x) && (A.y == y); }
  long double getang() { return y / x; }
} a[200005], stk[200005];
int n;
map<long double, int> app;
map<po, vector<int> > biao;
vector<int> ans;
int main() {
  scanf("%d", &n);
  for (int i = (int)1; i <= (int)n; i++) {
    a[i].read();
    biao[a[i]].push_back(i);
  }
  sort(a + 1, a + n + 1);
  int top = 0;
  for (int i = (int)1; i <= (int)n; i++) {
    if (a[i] == a[i + 1]) continue;
    if (a[i].x == a[i + 1].x) continue;
    if (app[a[i].y]) continue;
    app[a[i].y] = 1;
    while (top > 1) {
      long double K1 = (a[i] - stk[top - 1]).getang();
      long double K2 = (a[i] - stk[top]).getang();
      if (K2 > 1e-6 || K1 > 1e-6) break;
      if (K2 - K1 >= -1e-12) break;
      top--;
    }
    if (top) {
      long double U = (a[i] - stk[top]).getang();
      if (U > 1e-6) continue;
    }
    stk[++top] = a[i];
  }
  vector<int> A;
  for (int i = (int)1; i <= (int)top; i++) {
    A = biao[stk[i]];
    for (int j = 0; j < (int)A.size(); j++) {
      ans.push_back(A[j]);
    }
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < (int)ans.size(); i++) printf("%d ", ans[i]);
  return 0;
}
