#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
inline void chmin(A &a, B b) {
  if (a > b) a = b;
}
template <typename A, typename B>
inline void chmax(A &a, B b) {
  if (a < b) a = b;
}
long long N;
long long S[222222], R[222222];
bool ushi(pair<long long, long long> a, pair<long long, long long> b,
          pair<long long, long long> c) {
  return (a.first * c.first - b.first * c.first) *
             (a.second * b.second - b.second * c.second) >=
         (a.second * c.second - b.second * c.second) *
             (a.first * b.first - b.first * c.first);
}
signed main() {
  scanf("%lld", &N);
  for (long long i = 0; i < (N); i++) scanf("%lld%lld", &S[i], &R[i]);
  vector<pair<long long, long long> > v;
  for (long long i = 0; i < (N); i++)
    v.push_back(pair<long long, long long>(S[i], R[i]));
  sort((v).begin(), (v).end());
  reverse((v).begin(), (v).end());
  vector<pair<long long, long long> > u;
  for (auto p : v) {
    if (u.size() && u.back().second >= p.second) continue;
    u.push_back(p);
  }
  reverse((u).begin(), (u).end());
  vector<pair<long long, long long> > st;
  for (long long i = (long long)u.size() - 1; i >= 0; i--) {
    while (st.size() >= 2 && !ushi(st[st.size() - 2], st.back(), u[i]))
      st.pop_back();
    st.push_back(u[i]);
  }
  sort((st).begin(), (st).end());
  vector<long long> ans;
  for (long long i = 0; i < (N); i++) {
    if (binary_search((st).begin(), (st).end(),
                      pair<long long, long long>(S[i], R[i])))
      ans.push_back(i);
  }
  for (long long i = 0; i < (ans.size()); i++) {
    if (i) printf(" ");
    printf("%lld", ans[i] + 1);
  }
  puts("");
  return 0;
}
