#include <bits/stdc++.h>
using namespace std;
int n;
set<pair<pair<int, int>, int> > st;
pair<int, int> s[300005];
void init() { scanf("%d", &n); }
vector<pair<pair<int, int>, int> > v, t;
vector<int> ans;
set<pair<int, int> > aset;
void process() {
  st.insert(pair<pair<int, int>, int>(pair<int, int>(0, 100000), -1));
  st.insert(pair<pair<int, int>, int>(pair<int, int>(100000, 0), -1));
  int a, b;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &a, &b);
    s[i] = pair<int, int>(a, b);
    auto ptr =
        st.lower_bound(pair<pair<int, int>, int>(pair<int, int>(a, b), 100000));
    ptr--;
    while (ptr != st.begin() && ptr->first.second <= b) {
      auto tmp = ptr;
      ptr--;
      st.erase(tmp);
    }
    ptr++;
    if (ptr->first.second >= b) continue;
    st.insert(pair<pair<int, int>, int>(pair<int, int>(a, b), i + 1));
  }
  for (__typeof((st).begin()) it = (st).begin(); it != (st).end(); it++) {
    if (it->second != -1) v.push_back(*it);
  }
  for (int i = 0; i < (int)v.size(); i++) {
    pair<int, int> tmp = v[i].first;
    while (t.size() >= 2) {
      pair<int, int> t0 = t[t.size() - 1].first, t1 = t[t.size() - 2].first;
      if ((long long)t1.first * (t0.second - t1.second) *
              (t0.first * tmp.second - tmp.first * t0.second) >
          (long long)tmp.first * (tmp.second - t0.second) *
              (t1.first * t0.second - t0.first * t1.second))
        t.pop_back();
      else
        break;
    }
    t.push_back(v[i]);
  }
  for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++)
    aset.insert(it->first);
  for (int i = 0; i < n; i++) {
    if (aset.count(s[i])) printf("%d ", i + 1);
  }
  puts("");
}
int main() {
  init();
  process();
  return 0;
}
