#include <bits/stdc++.h>
using namespace std;
int n, m, p, l, ans[200005], ans2[200005], q[200005], hd, tl;
struct d {
  int x, y, id;
} s[200005], t[200005];
bool cmp(d a, d b) { return a.x != b.x ? a.x > b.x : a.y > b.y; }
int main() {
  scanf("%d", &n);
  for (int i = (0); i < (n); i++) {
    scanf("%d %d", &s[i].x, &s[i].y);
    s[i].id = i + 1;
  }
  sort(s, s + n, cmp);
  for (int i = (0); i < (n); i++) {
    m = s[i].y;
    int x = s[i].x;
    while (i < n && s[i].x == x) {
      if (s[i].y == m && s[i].y > p) t[l++] = s[i];
      i++;
    }
    p = max(p, m);
    i--;
  }
  for (int i = (0); i < (l); i++) {
    int j = i;
    while (i < n && t[i].x == t[j].x && t[i].y == t[j].y) i++;
    i--;
    while (hd + 1 < tl &&
           (long long)t[q[tl - 1]].x * t[q[tl - 2]].y *
                   (t[q[tl - 1]].y - t[i].y) * (t[i].x - t[q[tl - 2]].x) >
               (long long)t[q[tl - 2]].x * t[q[tl - 1]].y *
                   (t[i].x - t[q[tl - 1]].x) * (t[q[tl - 2]].y - t[i].y))
      tl--;
    q[tl++] = i;
  }
  for (int i = (0); i < (tl); i++) ans[q[i]] = 1;
  int ptr = 0;
  for (int i = (0); i < (l); i++) {
    while (ptr < tl && q[ptr] < i) ptr++;
    if (ptr < tl && t[i].x == t[q[ptr]].x && t[i].y == t[q[ptr]].y)
      ans2[t[i].id] = 1;
  }
  for (int i = (1); i <= (n); i++)
    if (ans2[i]) printf("%d\n", i);
  scanf("\n");
}
