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;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
class SegmentTree {
 private:
  int n;
  vector<int> A, st, rv;
  int left(int p) { return p << 1; }
  int right(int p) { return (p << 1) + 1; }
  void build(int p, int L, int R) {
    if (L == R) {
      st[p] = L;
      rv[L] = p;
    } else {
      build(left(p), L, (L + R) / 2);
      build(right(p), (L + R) / 2 + 1, R);
      int u = st[left(p)];
      int v = st[right(p)];
      st[p] = A[u] > A[v] ? u : v;
    }
  }
  int rmq(int p, int L, int R, int i, int j) {
    if (i > R | j < L) return -1;
    if (i <= L && j >= R) return st[p];
    int u = rmq(left(p), L, (L + R) / 2, i, j);
    int v = rmq(right(p), (L + R) / 2 + 1, R, i, j);
    if (u == -1) return v;
    if (v == -1) return u;
    return A[u] > A[v] ? u : v;
  }

 public:
  void init(int a[], int len) {
    n = len;
    for (int i = 0; i < n; i++) A.push_back(a[i]);
    st.assign(4 * n, 0);
    rv.assign(n, 0);
    build(1, 0, n - 1);
  }
  void init(const vector<int> &_A) {
    A = _A;
    n = int((_A).size());
    st.assign(4 * n, 0);
    rv.assign(n, 0);
    build(1, 0, n - 1);
  }
  void modify(int i, int k) {
    A[i] = k;
    int p = rv[i];
    while (p >>= 1) {
      int u = st[left(p)], v = st[right(p)];
      st[p] = A[u] > A[v] ? u : v;
    }
  }
  int rmq(int a, int b) { return rmq(1, 0, n - 1, a, b); }
};
const int maxn = 200010;
int n;
int s[maxn];
int r[maxn];
void solve() {
  scanf("%d", &n);
  vector<pair<pair<int, int>, int> > v;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", s + i, r + i);
    v.push_back(make_pair(pair<int, int>(s[i], r[i]), i));
  }
  sort(v.begin(), v.end());
  vector<int> v2;
  for (int i = 0; i < int((v).size()); i++) v2.push_back(v[i].first.second);
  SegmentTree smt;
  smt.init(v2);
  vector<int> ans;
  for (int i = 0; i < int((v).size()) - 1; i++) {
    int k = smt.rmq(i + 1, int((v).size()) - 1);
    if (v[k].first.second < v[i].first.second || v[k].first == v[i].first)
      ans.push_back(v[i].second);
  }
  ans.push_back(v.back().second);
  sort(ans.begin(), ans.end());
  for (int i = 0; i < int((ans).size()); i++) printf("%d ", ans[i] + 1);
}
int main() {
  solve();
  return 0;
}
