#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
inline bool mina(A &x, B y) {
  return (x > y) ? (x = y, 1) : 0;
}
template <class A, class B>
inline bool maxa(A &x, B y) {
  return (x < y) ? (x = y, 1) : 0;
}
int X[(200005)], Y[(200005)];
int N;
set<tuple<int, int> > good;
int maxY[(10005)];
int sz_S;
tuple<int, int> S[(200005)];
void add_point(int x3, int y3) {
  while (sz_S >= 2) {
    int x1 = get<0>(S[sz_S - 2]), y1 = get<1>(S[sz_S - 2]);
    int x2 = get<0>(S[sz_S - 1]), y2 = get<1>(S[sz_S - 1]);
    if ((long long)y2 * x3 * (x1 - x2) * (y1 - y3) <
        (long long)x2 * y3 * (y1 - y2) * (x1 - x3)) {
      sz_S--;
    } else {
      break;
    }
  }
  S[sz_S++] = tuple<int, int>(x3, y3);
}
int main() {
  scanf("%d", &N);
  for (int(i) = 0; (i) < (N); ++(i)) {
    scanf("%d %d", &X[i], &Y[i]);
    maxa(maxY[X[i]], Y[i]);
  }
  int pre_y = 0;
  for (int i = (10005) - 1; i >= 1; i--) {
    if (maxY[i] > pre_y) {
      add_point(i, maxY[i]);
      pre_y = maxY[i];
    }
  }
  for (int(i) = 0; (i) < (sz_S); ++(i)) {
    good.insert(S[i]);
  }
  for (int(i) = 0; (i) < (N); ++(i)) {
    if (good.find(tuple<int, int>(X[i], Y[i])) != good.end()) {
      printf("%d ", i + 1);
    }
  }
  return 0;
}
