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;
using ll = long long;
using pii = pair<int, int>;
void solve() {
  int n;
  cin >> n;
  map<pii, vector<int>> ma;
  for (int i = 0; i < n; i++) {
    int ra, rb;
    cin >> ra >> rb;
    ma[{ra, rb}].push_back(i + 1);
  }
  vector<pii> st{ma.rbegin()->first};
  for (auto it = ++ma.rbegin(); it != ma.rend(); it++) {
    pii l = it->first;
    if (l.first == st.back().first || l.second <= st.back().second) continue;
    auto check = [&]() {
      if (int((st).size()) < 2) return false;
      pii m = st.back(), r = st[int((st).size()) - 2];
      return l.first * m.second * ll(l.second - r.second) *
                 (r.first - m.first) >
             l.second * m.first * ll(m.second - r.second) * (r.first - l.first);
    };
    while (check()) st.pop_back();
    st.push_back(l);
  }
  vector<int> ans;
  for (pii &p : st) ans.insert(ans.end(), (ma[p]).begin(), (ma[p]).end());
  sort((ans).begin(), (ans).end());
  for (int x : ans) cout << x << ' ';
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int tcs = 1;
  for (int tc = 1; tc <= tcs; tc++) {
    solve();
  }
}
