#include <bits/stdc++.h>
using std::cin;
using std::cout;
const long long N = 300007;
struct _ {
  long long a, b, idx;
} p[N];
bool cmp(_ a, _ b) {
  if (a.a == b.a) return a.b > b.b;
  return a.a > b.a;
}
double check(_ x, _ y) {
  return (double)x.a * y.a * (y.b - x.b) / (y.a - x.a) / y.b / x.b;
}
long long n, t, s[N], v[N], ans[N];
signed main() {
  std::ios::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    cin >> p[i].a >> p[i].b;
    p[i].idx = i;
  }
  std::sort(p + 1, p + 1 + n, cmp);
  s[1] = 1;
  t = 1;
  long long max = p[1].b;
  for (long long i = 2; i <= n; ++i) {
    if (p[i].b <= max)
      v[i] = 1;
    else
      max = p[i].b;
  }
  for (long long i = 2; i <= n; ++i) {
    if (v[i]) continue;
    if (check(p[i], p[s[t]]) > 0) continue;
    while (t > 1 && check(p[i], p[s[t]]) < check(p[s[t - 1]], p[s[t]])) --t;
    s[++t] = i;
  }
  for (long long i = 1; i <= t; ++i) {
    ans[p[s[i]].idx] = 1;
    for (long long j = s[i] + 1;
         j <= n && p[s[i]].a == p[j].a && p[s[i]].b == p[j].b; ++j)
      ans[p[j].idx] = 1;
  }
  for (long long i = 1; i <= n; ++i)
    if (ans[i]) cout << i << ' ';
  return 0;
}
