#include <bits/stdc++.h>
using namespace std;
int n;
map<pair<int, int>, vector<int> > M;
pair<int, int> a[222222];
vector<int> ans;
bool bad(int a, int b, int c, int d, int e, int first) {
  long long xx = 1LL * (b - d) * (e - c) * a * first;
  long long yy = 1LL * (d - first) * (c - a) * b * e;
  return xx > yy;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    M[make_pair(x, y)].push_back(i);
    a[i] = make_pair(x, y);
  }
  sort(a, a + n);
  n = unique(a, a + n) - a;
  int an = 0;
  for (int i = 0; i < n; i++) {
    while (an > 0 && a[an - 1].second <= a[i].second) {
      --an;
    }
    a[an++] = a[i];
  }
  n = an;
  reverse(a, a + n);
  an = 0;
  for (int i = 0; i < n; i++) {
    while (an > 1 && bad(a[i].first, a[i].second, a[an - 1].first,
                         a[an - 1].second, a[an - 2].first, a[an - 2].second)) {
      --an;
    }
    a[an++] = a[i];
  }
  n = an;
  for (int i = 0; i < n; i++) {
    for (__typeof(M[a[i]].begin()) it = M[a[i]].begin(); it != M[a[i]].end();
         ++it) {
      ans.push_back(*it);
    }
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) {
    if (i > 0) {
      putchar(' ');
    }
    printf("%d", ans[i] + 1);
  }
  puts("");
  return 0;
}
