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;
pair<pair<long long, long long>, int> comp[200002], comp2[200002];
long long cross(pair<long long, long long> x, pair<long long, long long> y,
                pair<long long, long long> z) {
  return (x.first * z.first - y.first * z.first) *
             (x.second * y.second - x.second * z.second) -
         (x.second * z.second - y.second * z.second) *
             (x.first * y.first - x.first * z.first);
}
bool cmp(pair<pair<long long, long long>, int> x,
         pair<pair<long long, long long>, int> y) {
  return x.first == y.first;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%I64d %I64d", &comp[i].first.first, &comp[i].first.second);
    comp[i].second = i;
  }
  sort(comp, comp + n);
  int unik = 1;
  comp2[0] = comp[0];
  for (int i = 0; i < n - 1; i++) {
    if (comp[i].first != comp[i + 1].first) comp2[unik++] = comp[i + 1];
  }
  vector<int> hull;
  for (int i = 0; i < unik; i++) {
    while (hull.size() >= 2 &&
           cross(comp2[hull[hull.size() - 2]].first, comp2[hull.back()].first,
                 comp2[i].first) > 0)
      hull.pop_back();
    hull.push_back(i);
  }
  vector<int> ans;
  while (hull.size() >= 2) {
    pair<long long, long long> bef = comp2[hull[hull.size() - 2]].first;
    pair<long long, long long> now = comp2[hull.back()].first;
    if (bef.second <= now.second) break;
    ans.push_back(hull.back());
    hull.pop_back();
  }
  ans.push_back(hull.back());
  set<pair<long long, long long> > s;
  for (int i = 0; i < ans.size(); i++) s.insert(comp2[ans[i]].first);
  vector<int> ans2;
  for (int i = 0; i < n; i++)
    if (s.count(comp[i].first)) ans2.push_back(comp[i].second);
  sort(ans2.begin(), ans2.end());
  for (int i = 0; i < ans2.size(); i++) printf("%d ", ans2[i] + 1);
  printf("\n");
  return 0;
}
