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;
using lli = long long;
using lld = long double;
using ulli = unsigned long long int;
using pll = pair<lli, lli>;
using ttt = pair<lli, pll>;
using vttt = vector<ttt>;
using vll = vector<pll>;
using vl = vector<lli>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using cd = complex<lld>;
const double PI = acos(-1);
struct frac {
  lli num, den;
  frac() {
    num = 0;
    den = 1;
  }
  frac(lli n, lli d) : num(n), den(d) {
    if (den < 0) {
      num *= -1;
      den *= -1;
    }
  }
  inline bool operator<(const frac &rhs) const {
    return num * rhs.den < den * rhs.num;
  }
  inline bool operator>(const frac &rhs) const {
    return num * rhs.den > den * rhs.num;
  }
  inline bool operator<=(const frac &rhs) const {
    return num * rhs.den <= den * rhs.num;
  }
  inline bool operator>=(const frac &rhs) const {
    return num * rhs.den >= den * rhs.num;
  }
  inline bool operator==(const frac &rhs) const {
    return num * rhs.den == den * rhs.num;
  }
  inline bool operator!=(const frac &rhs) const {
    return num * rhs.den != den * rhs.num;
  }
  inline frac operator+(const frac &rhs) const {
    return frac(num * rhs.den + den * rhs.num, den * rhs.den);
  }
  inline frac operator-(const frac &rhs) const {
    return frac(num * rhs.den - den * rhs.num, den * rhs.den);
  }
  inline frac operator*(const frac &rhs) const {
    return frac(num * rhs.num, den * rhs.den);
  }
  inline frac operator/(const frac &rhs) const {
    return frac(num * rhs.den, den * rhs.num);
  }
  inline frac operator-() const { return frac(-num, den); }
  inline frac operator+() const { return *this; }
};
using Data_type = frac;
struct pnt {
  Data_type x, y;
  int ind;
  pnt() {}
  pnt(Data_type a, Data_type b, int ind = 0) : x(a), y(b), ind(ind) {}
  inline pnt operator-(const pnt &p) { return pnt(x - p.x, y - p.y); }
  inline pnt operator+(const pnt &p) { return pnt(x + p.x, y + p.y); }
  inline Data_type cross(const pnt &b) { return x * b.y - y * b.x; }
  inline Data_type dot(const pnt &b) { return x * b.x + y * b.y; }
  inline Data_type dist(pnt p) {
    return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
  }
  inline bool operator<(const pnt &rhs) const {
    return (x == rhs.x) ? (y < rhs.y) : (x < rhs.x);
  }
};
Data_type cross(pnt o, pnt a, pnt b) { return (a - o).cross(b - o); }
vector<pnt> convex_hull(vector<pnt> pts) {
  vector<pnt> hull, fin;
  sort(pts.begin(), pts.end());
  for (auto &cur : pts) {
    while (((lli)(hull).size()) >= 2 &&
           cross(hull[((lli)(hull).size()) - 2], hull.back(), cur) < frac(0, 1))
      hull.pop_back();
    hull.push_back(cur);
  }
  fin.push_back(hull[0]);
  for (int i = 1; i < ((lli)(hull).size()); i++) {
    if (hull[i].y < hull[i - 1].y)
      fin.push_back(hull[i]);
    else
      break;
  }
  return fin;
}
int tejas_919(int kkkk) {
  lli n, m, k, q, u, v, temp = 0, ans = 0;
  cin >> n;
  std::vector<pnt> vect;
  for (int i = 0; i < n; i++) {
    cin >> u >> v;
    vect.push_back(pnt(frac(1, u), frac(1, v), i + 1));
  }
  vect = convex_hull(vect);
  vi fin;
  for (auto &x : vect) fin.push_back(x.ind);
  sort(fin.begin(), fin.end());
  for (auto &x : fin) cout << x << " ";
  cout << '\n';
  return 0;
}
signed main() {
  if (!0) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  }
  cout << fixed << setprecision(10);
  int t = 1;
  for (int i = 0; i < t; i++) {
    tejas_919(i + 1);
  }
  {};
  if (0) system("pause");
}
