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 
5
10 50
10 50
10 50
10 50
10 50
 2
10000 10000
10000 10000
 3
10000 10000
10000 10000
10000 10000
 3
1000 3000
1500 1500
3000 1000
 43
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 1
1 1
 2
1 1
1 1
 44
78 52
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 3
1000 3000
1499 1499
3000 1000
 5
50 50
49 50
50 49
49 49
50 1
 18
82 38
33 69
33 69
33 69
33 69
33 69
82 38
33 69
33 69
33 69
82 38
33 69
33 69
82 38
82 38
33 69
33 69
33 69
 1
10000 9999
 3
1000 3000
1501 1501
3000 1000
 2
1 2
2 1

1 2 3 4 5
 1 2
 1 2 3
 1 2 3
 1 3 16 24 29 31 32 37 41 42
 1
 1 2
 1
 1 3
 1
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 1
 1 2 3
 1 2 

#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i) {
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  }
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
  os << '{';
  for (auto itr = m.begin(); itr != m.end(); ++itr) {
    os << '(' << itr->first << ',' << itr->second << ')';
    if (++itr != m.end()) os << ',';
    --itr;
  }
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &s) {
  os << '{';
  for (auto itr = s.begin(); itr != s.end(); ++itr) {
    os << *itr;
    if (++itr != s.end()) os << ',';
    --itr;
  }
  os << '}';
  return os;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0) cerr << ", ";
  debug_out(move(tail)...);
}
template <typename T>
T gcd(T x, T y) {
  return y != 0 ? gcd(y, x % y) : x;
}
template <typename T>
T lcm(T x, T y) {
  return x / gcd(x, y) * y;
}
template <class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, bool isMin = true>
struct ConvexHullTrick {
  struct Line {
    T a, b;
    Line(T a, T b) : a(a), b(b) {}
  };
  deque<Line> Lines;
  bool empty() const { return Lines.empty(); }
  inline int sgn(T a) { return a == 0 ? 0 : (a < 0 ? -1 : 1); }
  inline bool check(const Line &a, const Line &b, const Line &c) {
    if (b.b == a.b || c.b == b.b)
      return sgn(b.a - a.a) * sgn(c.b - b.b) >= sgn(c.a - b.a) * sgn(b.b - a.b);
    return (long double)(b.a - a.a) * sgn(c.b - b.b) /
               (long double)abs(b.b - a.b) >=
           (long double)(c.a - b.a) * sgn(b.b - a.b) /
               (long double)abs(c.b - b.b);
  }
  void add(T a, T b) {
    if (!isMin) a *= -1, b *= -1;
    Line l(a, b);
    if (empty()) {
      Lines.emplace_back(l);
      return;
    }
    if (Lines.front().a <= a) {
      if (Lines.front().a == a) {
        if (Lines.front().b <= b) return;
        Lines.pop_front();
      }
      while (Lines.size() >= 2 && check(l, Lines.front(), Lines[1]))
        Lines.pop_front();
      Lines.emplace_front(l);
    } else {
      if (Lines.back().a == a) {
        if (Lines.back().b <= b) return;
        Lines.pop_back();
      }
      while (Lines.size() >= 2 &&
             check(Lines[Lines.size() - 2], Lines.back(), l))
        Lines.pop_back();
      Lines.emplace_back(l);
    }
  }
  inline T f(const Line &l, const T &x) { return l.a * x + l.b; }
  T query(T x) {
    int lb = -1, ub = Lines.size() - 1;
    while (ub - lb > 1) {
      int mid = (ub + lb) >> 1;
      (f(Lines[mid], x) >= f(Lines[mid + 1], x) ? lb : ub) = mid;
    }
    return (isMin ? f(Lines[ub], x) : -f(Lines[ub], x));
  }
  T query_monotone_inc(T x) {
    while (Lines.size() >= 2 && f(Lines.front(), x) >= f(Lines[1], x))
      Lines.pop_front();
    return (isMin ? f(Lines.front(), x) : -f(Lines.front(), x));
  }
  T query_monotone_dec(T x) {
    while (Lines.size() >= 2 &&
           f(Lines.back(), x) >= f(Lines[Lines.size() - 2], x))
      Lines.pop_back();
    return (isMin ? f(Lines.back(), x) : -f(Lines.back(), x));
  }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<tuple<long long, long long, int>> sr;
  for (int i = 0; i < n; ++i) {
    long long s, r;
    cin >> s >> r;
    sr.emplace_back(s, r, i);
  }
  sort((sr).begin(), (sr).end());
  struct Line {
    long long s, r;
    int id;
    Line(long long s, long long r, int id) : s(s), r(r), id(id) {}
  };
  deque<Line> Lines;
  auto check = [](Line a, Line b, Line c) {
    return c.s * a.r * (b.r - c.r) * (a.s - b.s) >
           a.s * c.r * (a.r - b.r) * (b.s - c.s);
  };
  auto add = [&](int s, int r, int id) {
    if (Lines.empty()) {
      Lines.emplace_back(s, r, id);
      return;
    }
    Line l(s, r, id);
    if (Lines.back().s == s) {
      if (Lines.back().r > r) return;
      if (Lines.back().r < r) Lines.pop_back();
    }
    while (Lines.size() >= 2 && check(Lines[Lines.size() - 2], Lines.back(), l))
      Lines.pop_back();
    Lines.emplace_back(l);
  };
  for (int i = 0; i < n; ++i) add(get<0>(sr[i]), get<1>(sr[i]), get<2>(sr[i]));
  vector<int> ans;
  for (auto l : Lines) ans.emplace_back(l.id);
  sort((ans).begin(), (ans).end());
  for (int i = 0; i < ans.size(); ++i)
    cout << ans[i] + 1 << (i + 1 == ans.size() ? '\n' : ' ');
}
