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;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
pair<long long, long long> intersect(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return make_pair(a.first * (b.second - a.second),
                   a.second * (b.first - a.first));
}
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * b.second < b.first * a.second;
}
vector<pair<int, int>> pts;
int a[N], b[N];
vector<pair<int, int>> ConvexHull(vector<pair<int, int>> vp) {
  sort(vp.begin(), vp.end());
  vector<pair<int, int>> hull;
  for (int i = 0; i < vp.size(); i++) {
    while (!hull.empty() && hull.back().second <= vp[i].second) hull.pop_back();
    hull.push_back(vp[i]);
  }
  return hull;
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
    pts.push_back({a[i], b[i]});
  }
  sort(pts.begin(), pts.end());
  pts = ConvexHull(pts);
  vector<pair<int, int>> upperHull;
  for (int i = 0; i < pts.size(); i++) {
    while (upperHull.size() > 1 &&
           cmp(intersect(pts[i], upperHull.back()),
               intersect(upperHull[upperHull.size() - 2], upperHull.back())))
      upperHull.pop_back();
    upperHull.push_back(pts[i]);
  }
  set<pair<int, int>> st;
  for (auto x : upperHull) st.insert(x);
  for (int i = 0; i < n; i++) {
    if (st.count(make_pair(a[i], b[i]))) cout << i + 1 << ' ';
  }
}
