#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
template <class T>
T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T sgn(T a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
int n;
int m;
vector<pair<pair<int, int>, int>> a;
long long vect(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  return ((long long)b.first - a.first) * ((long long)c.second - a.second) *
             (long long)b.second * c.first -
         ((long long)b.second - a.second) * ((long long)c.first - a.first) *
             (long long)b.first * c.second;
}
long long vect(int i, int j, int k) {
  return vect(a[i].first, a[j].first, a[k].first);
}
int main() {
  scanf("%d", &n);
  pair<pair<int, int>, int> right = make_pair(make_pair(-1, -1), -1),
                            down = make_pair(make_pair(-1, -1), -1);
  map<pair<int, int>, vector<int>> b;
  for (int i = 0; i < n; i++) {
    int r, s;
    scanf("%d%d", &r, &s);
    if (b.count(make_pair(r, s)) == 0) {
      a.push_back(make_pair(make_pair(r, s), i));
      right = max(make_pair(make_pair(r, s), i), right);
      down = max(make_pair(make_pair(s, r), i), down);
    }
    b[make_pair(r, s)].push_back(i);
  }
  sort((a).begin(), (a).end(),
       [](const pair<pair<int, int>, int>& a,
          const pair<pair<int, int>, int>& b) {
         int v =
             b.first.first * a.first.second - a.first.first * b.first.second;
         return v > 0 ||
                (v == 0 &&
                 1.0 / sqr(a.first.first) + 1.0 / sqr(a.first.second) >
                     1.0 / sqr(b.first.first) + 1.0 / sqr(b.first.second));
       });
  int i = 0;
  for (; i < n && a[i].second != down.second;) i++;
  vector<int> st;
  for (; i < n; i++) {
    while (((int)(st).size()) > 1 &&
           (vect(*-- --st.end(), *--st.end(), i) > 0 ||
            a[*--st.end()].first == a[i].first))
      st.pop_back();
    st.push_back(i);
    if (a[i].second == right.second) break;
  }
  vector<int> ans;
  for (auto& cur : st) {
    for (auto q : b[a[cur].first]) {
      ans.push_back(q + 1);
    }
  }
  sort((ans).begin(), (ans).end());
  for (auto cur : ans) printf("%d ", cur);
  return 0;
}
