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>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
struct R {
  R() : first(0), second(0) {}
  R(long long _x, long long _y) : first(_x), second(_y) {}
  long long first, second;
};
inline R operator+(const R& a, const R& b) {
  return R({a.first * b.second + b.first * a.second, a.second * b.second});
}
inline R operator-(const R& a, const R& b) {
  auto ans = R({a.first * b.second - b.first * a.second, a.second * b.second});
  if (ans.second < 0) {
    ans.first = -ans.first;
    ans.second = -ans.second;
  }
  return ans;
}
inline R operator*(const R& a, const R& b) {
  return R({a.first * b.first, a.second * b.second});
}
inline bool operator<(const R& a, const R& b) { return (a - b).first < 0; }
inline bool operator==(const R& a, const R& b) {
  return a.first == b.first && a.second == b.second;
}
template <class T>
pair<T, T> operator-(const pair<T, T>& a, const pair<T, T>& b) {
  return make_pair(a.first - b.first, a.second - b.second);
}
template <class T>
T vec(const pair<T, T>& a, const pair<T, T>& b) {
  return a.first * b.second - b.first * a.second;
}
template <class T>
T vec(const pair<pair<T, T>, int>& a, const pair<pair<T, T>, int>& b) {
  return vec(a.first, b.first);
}
inline long long gcd(long long a, long long b) {
  for (; b; swap(a, b)) a %= b;
  return a;
}
inline long long aaa(long long a) {
  if (a < 0)
    return -a;
  else
    return a;
}
inline R neg(const R& a) { return R(-a.first, a.second); }
inline R sw(const R& a) { return R(a.second, a.first); }
bool cmp(R p1, R p2) {
  long long d1 = p1.first / p1.second;
  long long d2 = p2.first / p2.second;
  if (d1 != d2) return d1 < d2;
  p1.first %= p1.second;
  p2.first %= p2.second;
  if (!p1.first && !p2.first) return 0;
  if (!p1.first) return 1;
  if (!p1.second) return 0;
  bool ans = cmp(sw(p2), sw(p1));
  return ans;
}
inline bool bad(pair<R, R> a, pair<R, R> b) {
  auto p1 = a.first * b.second;
  auto p2 = b.first * a.second;
  if (p1.first < 0 && p2.first > 0) return 1;
  if (p1.first > 0 && p2.first < 0) return 0;
  long long g1 = gcd(aaa(p1.first), aaa(p1.second));
  long long g2 = gcd(aaa(p2.first), aaa(p2.second));
  if (p1.first / g1 == p2.first / g2 && p1.second / g1 == p2.second / g2)
    return 0;
  if (p1.first < 0 && p2.first < 0)
    return cmp(neg(p2), neg(p1));
  else
    return cmp(p1, p2);
}
int a, b, c, d, n, m, k;
pair<pair<int, int>, int> mas[200002];
int fen[200002];
inline void upd(int first, int val) {
  for (; first >= 0; first = (first & (first + 1)) - 1) fen[first] += val;
}
inline int fnd(int first) {
  int ans = 0;
  for (; first <= 200000; first |= first + 1) ans += fen[first];
  return ans;
}
int main() {
  scanf("%d", &n);
  vector<int> ny;
  for (int _n((n)-1), i(0); i <= _n; i++) {
    scanf("%d%d", &mas[i].first.first, &mas[i].first.second);
    mas[i].second = i;
    ny.push_back(mas[i].first.second);
  }
  sort((ny).begin(), (ny).end());
  ny.resize(unique((ny).begin(), (ny).end()) - ny.begin());
  sort(mas, mas + n);
  vector<pair<int, int>> cool;
  for (int i = (n - 1), _b = (0); i >= _b; i--) {
    if (i != n - 1 && mas[i + 1].first == mas[i].first) continue;
    int t =
        lower_bound((ny).begin(), (ny).end(), mas[i].first.second) - ny.begin();
    if (!fnd(t)) cool.push_back(mas[i].first);
    upd(t, 1);
  }
  vector<pair<R, R>> pnt;
  for (int _n(((int)((cool).size())) - 1), i(0); i <= _n; i++) {
    R first({1LL, (long long)cool[i].first});
    R second({1LL, (long long)cool[i].second});
    auto t = make_pair(first, second);
    pnt.push_back(t);
  }
  sort((pnt).begin(), (pnt).end());
  vector<pair<R, R>> hull;
  for (int _n(((int)((pnt).size())) - 1), i(0); i <= _n; i++) {
    if (i && pnt[i - 1].first == pnt[i].first) continue;
    auto t = pnt[i];
    while (hull.size() > 1 && bad(hull.back() - hull[(int)((hull).size()) - 2],
                                  t - hull[(int)((hull).size()) - 2]))
      hull.pop_back();
    hull.push_back(t);
  }
  sort((hull).begin(), (hull).end());
  vector<int> res;
  for (int _n((n)-1), i(0); i <= _n; i++) {
    R first({1LL, (long long)mas[i].first.first});
    R second({1LL, (long long)mas[i].first.second});
    auto t = make_pair(first, second);
    if (binary_search((hull).begin(), (hull).end(), t)) {
      res.push_back(mas[i].second);
    }
  }
  sort((res).begin(), (res).end());
  for (int _n(((int)((res).size())) - 1), i(0); i <= _n; i++) {
    if (i) printf(" ");
    printf("%d", res[i] + 1);
  }
  printf("\n");
}
