#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-25, inf = 2e+15;
pair<int, int> v[200010], v1[200010];
map<pair<int, int>, char> sol;
int v2[200010];
int cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first)
    return a.second > b.second;
  else
    return a.first < b.first;
}
int scoate(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  return (
      1LL * a.first * c.second * (a.second - b.second) * (c.first - b.first) >
      1LL * a.second * c.first * (b.first - a.first) * (b.second - c.second));
}
int main() {
  int n, nr = 0, nr2 = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &v[i].first, &v[i].second);
    v1[i] = v[i];
  }
  sort(v1 + 1, v1 + 1 + n, cmp);
  for (int i = 1; i <= n; i++)
    if (v1[i].first != v1[nr].first) v1[++nr] = v1[i];
  for (int i = 1; i <= nr; i++) {
    while (nr2 >= 2 && scoate(v1[v2[nr2 - 1]], v1[v2[nr2]], v1[i])) nr2--;
    v2[++nr2] = i;
  }
  sol[v1[v2[nr2]]] = 1;
  for (int i = 1; i < nr2; i++)
    if (v1[v2[i]].second > v1[v2[i + 1]].second) sol[v1[v2[i]]] = 1;
  for (int i = 1; i <= n; i++)
    if (sol[v[i]]) printf("%d ", i);
  return 0;
}
