Tavas is a cheerleader in the new sports competition named "Pashmaks".

<image>

This competition consists of two part: swimming and then running. People will immediately start running R meters after they finished swimming exactly S meters. A winner is a such person that nobody else finishes running before him/her (there may be more than one winner).

Before the match starts, Tavas knows that there are n competitors registered for the match. Also, he knows that i-th person's swimming speed is si meters per second and his/her running speed is ri meters per second. Unfortunately, he doesn't know the values of R and S, but he knows that they are real numbers greater than 0.

As a cheerleader, Tavas wants to know who to cheer up. So, he wants to know all people that might win. We consider a competitor might win if and only if there are some values of R and S such that with these values, (s)he will be a winner.

Tavas isn't really familiar with programming, so he asked you to help him.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 2 × 105).

The next n lines contain the details of competitors. i-th line contains two integers si and ri (1 ≤ si, ri ≤ 104).

Output

In the first and the only line of output, print a sequence of numbers of possible winners in increasing order.

Examples

Input

3
1 3
2 2
3 1


Output

1 2 3 


Input

3
1 2
1 1
2 1


Output

1 3 
#include <bits/stdc++.h>
using namespace std;
int run[10000 * 20 + 10];
struct Ath {
  int s, r;
  Ath(int s = 0, int r = 0) : s(s), r(r) {}
} ath[10000 * 20 + 10];
int k, s[10000 * 20 + 10], r[10000 * 20 + 10];
bool can_win(int s1, int r1, int s2, int r2, int s3, int r3) {
  double t1 = (1.0 / r2 - 1.0 / r1) / (1.0 / s1 - 1.0 / s2);
  double t2 = (1.0 / r3 - 1.0 / r2) / (1.0 / s2 - 1.0 / s3);
  if (t2 - t1 >= -1e-9)
    return true;
  else
    return false;
}
int main() {
  int n;
  while (~scanf("%d", &n)) {
    memset(run, 0, sizeof(run));
    for (int i = 1; i <= n; i++) {
      scanf("%d%d", &s[i], &r[i]);
      run[s[i]] = max(run[s[i]], r[i]);
    }
    k = 0;
    int i;
    for (i = 10000; i >= 0; i--) {
      if (run[i]) {
        ath[k++] = Ath(i, run[i]);
        break;
      }
    }
    for (i = i - 1; i >= 0; i--) {
      run[i] = max(run[i], run[i + 1]);
      if (run[i] > run[i + 1]) {
        while (k > 1) {
          if (!can_win(i, run[i], ath[k - 1].s, ath[k - 1].r, ath[k - 2].s,
                       ath[k - 2].r)) {
            k--;
          } else
            break;
        }
        ath[k++] = Ath(i, run[i]);
      }
    }
    map<int, int> m;
    for (int i = 0; i < k; i++) {
      m[ath[i].s] = ath[i].r;
    }
    bool flag = true;
    for (int i = 1; i <= n; i++) {
      if (m[s[i]] == r[i]) {
        if (flag)
          printf("%d", i);
        else
          printf(" %d", i);
        flag = false;
      }
    }
    puts("");
  }
  return 0;
}
