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;
long long arr[4][200009];
map<pair<long long, long long>, vector<int> > a;
int main() {
  long long n;
  cin >> n;
  vector<pair<pair<long long, long long>, int> > v;
  for (int f = 1; f <= n; f++) {
    cin >> arr[0][f] >> arr[1][f];
    a[make_pair(arr[0][f], arr[1][f])].push_back(f);
    v.push_back(make_pair(make_pair(arr[0][f], arr[1][f]), f));
  }
  sort(v.begin(), v.end());
  vector<int> ans;
  ans.push_back(v[v.size() - 1].second);
  for (int f = (int)v.size() - 2; f >= 0; f--) {
    if (arr[1][v[f].second] <= arr[1][ans[ans.size() - 1]]) continue;
    while (ans.size() > 1) {
      long long x =
          (arr[1][ans[ans.size() - 2]] - arr[1][ans[ans.size() - 1]]) *
          arr[0][ans[ans.size() - 2]];
      long long y =
          (arr[0][ans[ans.size() - 2]] - arr[0][ans[ans.size() - 1]]) *
          arr[1][ans[ans.size() - 2]];
      long long x1 = (arr[1][ans[ans.size() - 1]] - arr[1][v[f].second]) *
                     arr[0][v[f].second];
      long long y1 = (arr[0][ans[ans.size() - 1]] - arr[0][v[f].second]) *
                     arr[1][v[f].second];
      if (x * y1 > x1 * y)
        ans.pop_back();
      else
        break;
    }
    ans.push_back(v[f].second);
  }
  vector<int> ans1;
  for (int f = 0; f < ans.size(); f++) {
    for (int f1 = 0; f1 < a[make_pair(arr[0][ans[f]], arr[1][ans[f]])].size();
         f1++)
      ans1.push_back(a[make_pair(arr[0][ans[f]], arr[1][ans[f]])][f1]);
  }
  sort(ans1.begin(), ans1.end());
  for (int f = 0; f < ans1.size(); f++) cout << ans1[f] << " ";
  cout << endl;
}
