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;
pair<long long, long long> old[200005], a[200005], S[200005];
set<pair<long long, long long> > T;
int X, Y, n, m, i;
int cross(pair<long long, long long> c, pair<long long, long long> a,
          pair<long long, long long> b) {
  return (b.first * a.first - a.first * c.first) *
                 (b.second * c.second - a.second * c.second) -
             (b.first * c.first - a.first * c.first) *
                 (a.second * b.second - a.second * c.second) <
         0;
}
const int cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first > b.first || a.first == b.first && a.second > b.second;
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++)
    scanf("%d%d", &X, &Y), old[i] = a[i] = make_pair(X, Y);
  sort(a + 1, a + n + 1, cmp);
  S[m = 1] = a[1];
  for (i = 2; i <= n; i++) {
    if (a[i].second <= S[m].second) continue;
    for (; m >= 2 && cross(S[m - 1], S[m], a[i]); m--)
      ;
    S[++m] = a[i];
  }
  for (i = 1; i <= m; i++) T.insert(S[i]);
  for (i = 1; i <= n; i++)
    if (T.count(old[i])) printf("%d ", i);
}
