#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > g[10004];
pair<pair<int, int>, int> p[200005];
pair<long double, long double> fin[200005];
vector<int> ind[200005];
bool elem[200005];
const long double eps = 1e-6;
bool lessThanEqual(long double a, long double b) {
  if (a < b + eps)
    return true;
  else
    return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int s, r;
    cin >> s >> r;
    g[s].push_back(make_pair(r, i));
  }
  n = 0;
  for (int i = 1; i <= 10000; ++i) {
    if (g[i].empty()) continue;
    sort(g[i].begin(), g[i].end());
    reverse(g[i].begin(), g[i].end());
    int j = 0;
    while (j < g[i].size() && g[i][j].first == g[i][0].first) {
      p[++n] = make_pair(make_pair(i, g[i][j].first), g[i][j].second);
      j++;
    }
    g[i].clear();
  }
  for (int i = 1; i <= n; ++i)
    g[p[i].first.second].push_back(make_pair(p[i].first.first, p[i].second));
  n = 0;
  for (int i = 1; i <= 10000; ++i) {
    if (g[i].empty()) continue;
    sort(g[i].begin(), g[i].end());
    reverse(g[i].begin(), g[i].end());
    int j = 0;
    while (j < g[i].size() && g[i][j].first == g[i][0].first) {
      p[++n] = make_pair(make_pair(g[i][j].first, i), g[i][j].second);
      j++;
    }
    g[i].clear();
  }
  sort(p + 1, p + n + 1);
  int mxr = 0;
  for (int i = n; i >= 1; i--) {
    int rval = p[i].first.second;
    if (rval < mxr) elem[i] = 1;
    mxr = max(mxr, rval);
  }
  int finct = 0;
  for (int i = 1; i <= n; ++i) {
    if (elem[i]) continue;
    fin[++finct] = make_pair(1.0 / (long double)p[i].first.first,
                             1.0 / (long double)p[i].first.second);
    int j = i;
    while (j <= n && p[j].first == p[i].first) {
      ind[finct].push_back(p[j].second);
      j++;
    }
    i = j - 1;
  }
  vector<int> ans;
  for (int v : ind[1]) ans.push_back(v);
  if (finct > 1)
    for (int v : ind[finct]) ans.push_back(v);
  for (int i = 2; i <= finct - 1; ++i) {
    long double mxr = 0.0;
    for (int j = i + 1; j <= finct; ++j) {
      mxr = max(
          mxr, (fin[i].first - fin[j].first) / (fin[j].second - fin[i].second));
    }
    long double mir = 1e18 + 5;
    for (int j = 1; j <= i - 1; ++j) {
      mir = min(
          mir, (fin[j].first - fin[i].first) / (fin[i].second - fin[j].second));
    }
    if (lessThanEqual(mxr, mir)) {
      for (int v : ind[i]) ans.push_back(v);
    }
  }
  sort(ans.begin(), ans.end());
  for (int v : ans) cout << v << " ";
  cout << '\n';
}
