#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 7;
long long n;
pair<long double, long double> a[MAXN];
vector<pair<long double, long double> > ans;
pair<long double, long double> vect(pair<long double, long double> a,
                                    pair<long double, long double> b) {
  return {b.first - a.first, b.second - a.second};
}
long double cp(pair<long double, long double> a,
               pair<long double, long double> b) {
  return a.first * b.second - a.second * b.first;
}
bool comp(long long i, long long j) { return a[i] < a[j]; }
void add(pair<long double, long double> p) {
  while (2 <= ans.size()) {
    auto prpr = ans[(long long)ans.size() - 2];
    auto pr = ans[(long long)ans.size() - 1];
    if (cp(vect(prpr, p), vect(prpr, pr)) < 0) {
      ans.pop_back();
    } else {
      break;
    }
  }
  while (ans.size() && ans.back() != p && ans.back().first <= p.first &&
         ans.back().second <= p.second)
    ans.pop_back();
  ans.push_back(p);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 0; i < n; ++i) {
    long long first, second;
    cin >> first >> second;
    a[i].first = 1 - 1.0 / first;
    a[i].second = 1 - 1.0 / second;
  }
  set<pair<long double, long double> > ms;
  for (long long i = 0; i < n; ++i) ms.insert(a[i]);
  for (auto e : ms) add(e);
  ms.clear();
  for (auto e : ans) ms.insert(e);
  for (long long i = 0; i < n; ++i) {
    if (ms.find(a[i]) != ms.end()) cout << i + 1 << ' ';
  }
  cout << '\n';
  return 0;
}
