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 mark[11111];
bool isok[11111];
int stk[211111], sz;
int s[211111], r[211111];
bool jud(int idx) {
  int i = stk[sz - 2], j = stk[sz - 1];
  return 1LL * (mark[j] - mark[i]) * j * mark[idx] * (i - idx) >=
         1LL * (mark[idx] - mark[i]) * idx * mark[j] * (i - j);
}
int main() {
  int n;
  scanf("%d", &n);
  int ma = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &s[i], &r[i]);
    mark[s[i]] = max(mark[s[i]], r[i]);
    ma = max(ma, s[i]);
  }
  int lr = 0;
  for (int i = ma; i > 0; i--) {
    if (mark[i] <= lr) continue;
    while (sz > 1 && !jud(i)) sz--;
    stk[sz++] = i;
    lr = mark[i];
  }
  while (sz) {
    isok[stk[sz - 1]] = 1;
    sz--;
  }
  for (int i = 1; i <= n; i++) {
    if (r[i] == mark[s[i]] && isok[s[i]]) printf("%d ", i);
  }
  printf("\n");
  return 0;
}
