#include <bits/stdc++.h>
using namespace std;
const int MN = 1e4 + 100;
const double E = 0.0000000001;
struct {
  double r;
  vector<int> index;
  ;
} compet[MN];
int ans[MN];
int ansPos = 0;
double lo[MN];
double hi[MN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < MN; ++i) {
    compet[i].r = 0;
    hi[i] = 1;
  }
  for (int i = 0; i < n; ++i) {
    int s, r;
    scanf("%d %d", &s, &r);
    if (compet[s].r == (double)r) {
      compet[s].index.push_back(i + 1);
    } else if (compet[s].r < r) {
      compet[s].r = r;
      compet[s].index.clear();
      compet[s].index.push_back(i + 1);
    }
  }
  for (int i = 0; i < MN; ++i) {
    if (compet[i].index.size() == 0) continue;
    double q = 1 / compet[i].r;
    double w = 1 / (double)i - 1 / compet[i].r;
    double qq, ww;
    for (int j = i + 1; j < MN; ++j) {
      if (compet[j].index.size() == 0) continue;
      qq = q - 1 / compet[j].r;
      ww = w - 1 / (double)j + 1 / compet[j].r;
      if (abs(ww) < E) {
        if (qq > 0) {
          hi[i] = -1;
        } else {
          hi[j] = -1;
        }
      } else {
        qq /= -ww;
        if (ww > 0) {
          hi[i] = min(hi[i], qq);
          lo[j] = max(lo[j], qq);
        } else {
          lo[i] = max(lo[i], qq);
          hi[j] = min(hi[j], qq);
        }
      }
    }
    if (hi[i] > lo[i] + E ||
        (abs(hi[i] - lo[i]) < E && lo[i] > 0 && lo[i] < 1)) {
      for (int x : compet[i].index) {
        ans[ansPos++] = x;
      }
    }
  }
  sort(ans, ans + ansPos);
  for (int i = 0; i < ansPos; ++i) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
