#include <bits/stdc++.h>
using namespace std;
const int MaxN(300003);
int a[MaxN], b[MaxN], S[MaxN], top;
map<pair<int, int>, int> F;
struct node {
  double x, y;
  inline bool operator<(const node &T) const {
    return x == T.x ? y < T.y : x < T.x;
  }
} p[MaxN];
double cross(const node &p1, const node &p2) {
  return (p1.x * p2.x * (p2.y - p1.y)) / (p1.y * p2.y * (p2.x - p1.x));
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a[i], &b[i]);
    p[i].x = a[i], p[i].y = b[i];
  }
  sort(p + 1, p + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (p[i].x == p[i + 1].x) continue;
    while (top > 1 &&
           cross(p[S[top - 1]], p[S[top]]) < cross(p[S[top - 1]], p[i]))
      --top;
    S[++top] = i;
  }
  for (int i = 1; i <= top; i++)
    if (i == top || cross(p[S[i]], p[S[i + 1]]) < 0)
      F[pair<int, int>(p[S[i]].x, p[S[i]].y)] = 1;
  for (int i = 1; i <= n; i++)
    if (F.count(pair<int, int>(a[i], b[i]))) printf("%d ", i);
  return 0;
}
