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 double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / abs1(a) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 300100;
int n;
pair<pair<int, int>, int> orig[maxn];
pair<double, double> p[maxn];
typename set<pair<double, double> >::iterator sit;
int getjud(pair<int, int> &b, pair<int, int> &a) {
  if (b.first > a.first && b.second >= a.second) return 1;
  if (b.first >= a.first && b.second > a.second) return 1;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &orig[i].first.first, &orig[i].first.second);
    orig[i].second = i;
  }
  sort(orig, orig + n);
  int lst = 0;
  for (int i = 0; i < n; i++) {
    while (lst && getjud(orig[i].first, orig[lst - 1].first)) lst--;
    orig[lst++] = orig[i];
  }
  for (int i = 0; i < lst; i++)
    p[i] = make_pair(10000.0 / orig[i].first.first, 1.0 / orig[i].first.second);
  set<pair<double, double> > s1, s2;
  for (int i = 0; i < lst; i++) {
    if (i == 0 || orig[i].first != orig[i - 1].first) s1.insert(p[i]);
  }
  priority_queue<pair<double, pair<double, double> >,
                 vector<pair<double, pair<double, double> > >,
                 greater<pair<double, pair<double, double> > > >
      pq;
  for (auto it = s1.begin(); it != s1.end(); it++) {
    auto it1 = it;
    it1++;
    if (it1 == s1.end()) break;
    pq.push(
        make_pair((it1->first - it->first) / (it->second - it1->second), *it1));
  }
  s2.insert(*s1.begin());
  for (; pq.size();) {
    pair<double, pair<double, double> > temp = pq.top();
    pq.pop();
    auto it = s1.find(temp.second);
    if (it == s1.end()) continue;
    if (it == s1.begin()) continue;
    auto rit = it;
    rit--;
    double t = (it->first - rit->first) / (rit->second - it->second);
    if (jud(t, temp.first) != 0) continue;
    if (rit == s1.begin()) {
      s2.insert(*it);
      s1.erase(rit);
      continue;
    }
    s1.erase(rit);
    rit = it;
    rit--;
    t = (it->first - rit->first) / (rit->second - it->second);
    pq.push(make_pair(t, *it));
  }
  int ans[maxn], lans = 0;
  ;
  for (int i = 0; i < lst; i++)
    if (s2.find(p[i]) != s2.end()) {
      ans[lans++] = orig[i].second;
    }
  sort(ans, ans + lans);
  for (int i = 0; i < lans; i++) printf("%d ", ans[i] + 1);
  puts("");
  return 0;
}
