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 N, dummy;
long long cmp(pair<int, int> p, pair<int, int> a, pair<int, int> b) {
  return (long long)a.second * b.first * (p.first - a.first) *
             (p.second - b.second) -
         (long long)a.first * b.second * (p.second - a.second) *
             (p.first - b.first);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> N;
  vector<pair<int, int> > input(N);
  for (int i = 0; i < (N); ++i) cin >> input[i].first >> input[i].second;
  vector<pair<int, int> > points(input);
  sort((points).begin(), (points).end());
  vector<pair<int, int> > ret1, ret2;
  for (int i = 0; i < (N); ++i) {
    while (((int)(ret1).size()) && ret1.back().second <= points[i].second)
      ret1.pop_back();
    ret1.push_back(points[i]);
  }
  for (int i = 0; i < (((int)(ret1).size())); ++i) {
    while (((int)(ret2).size()) > 1 &&
           cmp(ret2[((int)(ret2).size()) - 2], ret2.back(), ret1[i]) > 0)
      ret2.pop_back();
    ret2.push_back(ret1[i]);
  }
  set<pair<int, int> > pset((ret2).begin(), (ret2).end());
  for (int i = 0; i < N; i++)
    if (pset.count(input[i])) cout << i + 1 << " ";
  return 0;
}
