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;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
  return out << "(" << a.first << ", " << a.second << ")";
}
template <class A>
ostream &operator<<(ostream &out, const vector<A> &v) {
  out << "[";
  for (int i = 0; i < int(int(v.size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  return out << "]";
}
mt19937 rnd(time(NULL));
const int INF = int(1e9);
const long long INF64 = long long(1e18);
const int MOD = INF + 7;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
const int N = 200 * 1000 + 13;
int n;
pair<int, int> a[N];
bool read() {
  if (scanf("%d", &n) != 1) return false;
  for (int i = 0; i < int(n); i++) {
    scanf("%d%d", &a[i].first, &a[i].second);
    a[i].first *= 2;
    a[i].second *= 2;
  }
  return true;
}
vector<pair<pair<int, int>, pair<int, int>>> hull, vecs;
int sg(long long first) {
  if (first < 0) return -1;
  return first > 0;
}
bool dot(const pair<int, int> &a, const pair<int, int> &b, bool fl) {
  return sg(a.second * long long(b.second) + a.first * long long(b.first)) *
             sg(a.first * long long(b.first) * a.second * long long(b.second)) <
         fl;
}
long long cross(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first * b.second - a.second * b.first;
}
pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
  return make_pair(a.first - b.first, a.second - b.second);
}
void add_line(long double k, long double b, pair<int, int> i, bool fl) {
  pair<int, int> nw = {k, b};
  while (!vecs.empty() && dot(vecs.back().first, nw - hull.back().first, fl)) {
    hull.pop_back();
    vecs.pop_back();
  }
  if (!hull.empty()) {
    pair<int, int> p = (nw - hull.back().first);
    vecs.push_back(make_pair(make_pair(-p.second, p.first), i));
  }
  hull.push_back(make_pair(nw, i));
}
map<pair<int, int>, vector<int>> cur;
void solve() {
  hull.clear();
  vecs.clear();
  cur.clear();
  for (int i = 0; i < int(n); i++) cur[a[i]].push_back(i);
  vector<pair<int, int>> un;
  for (auto it : cur) un.push_back(it.first);
  sort(un.begin(), un.end(),
       [](const pair<int, int> &a, const pair<int, int> &b) {
         if (a.first != b.first) return a.first > b.first;
         return a.second > b.second;
       });
  for (auto it : un) add_line(it.first, it.second, it, false);
  add_line(-20001, -20001, make_pair(-1, -1), true);
  vector<int> res;
  for (auto it : hull)
    for (auto jt : cur[it.second]) res.push_back(jt + 1);
  sort(res.begin(), res.end());
  for (auto it : res) printf("%d ", it);
  puts("");
}
int main() {
  cerr.precision(15);
  cout.precision(15);
  cerr << fixed;
  cout << fixed;
  while (read()) {
    solve();
  }
}
