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 MAX = 200005;
pair<int, int> p[MAX];
vector<pair<int, int> > v;
int a[MAX], b[MAX];
pair<long long, long long> intersect(pair<int, int> a, pair<int, int> 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 < a.second * b.first);
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int tn = n;
  for (int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
    a[i] = p[i].first;
    b[i] = p[i].second;
  }
  sort(p, p + n);
  for (int i = 0; i < n; i++) {
    while (!v.empty() && v.back().second <= p[i].second) v.pop_back();
    v.push_back(p[i]);
  }
  n = v.size();
  for (int i = 0; i < n; i++) p[i] = v[i];
  v.clear();
  for (int i = 0; i < n; i++) {
    while (v.size() > 1 &&
           cmp(intersect(p[i], v.back()), intersect(v[v.size() - 2], v.back())))
      v.pop_back();
    v.push_back(p[i]);
  }
  set<pair<int, int> > s;
  for (int i = 0; i < v.size(); i++) s.insert(v[i]);
  vector<int> ans;
  for (int i = 0; i < tn; i++)
    if (s.count(make_pair(a[i], b[i]))) ans.push_back(i + 1);
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
