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;
int N, k;
vector<int> sol;
struct pct {
  long long x, y;
  int ind = 0;
  pct() {
    x = 0;
    y = 0;
    ind = 0;
  }
  pct(long long a, long long b, int i) {
    x = a;
    y = b;
    ind = i;
  }
};
vector<pct> v;
inline long long signc(pct a, pct b, pct c) {
  return (a.x - b.x) * (a.y - c.y) * b.y * c.x -
         (a.y - b.y) * (a.x - c.x) * b.x * c.y;
}
inline bool cw(pct a, pct b, pct c) { return signc(a, b, c) > 0; }
inline bool ccw(pct a, pct b, pct c) { return signc(a, b, c) < 0; }
bool cmp(pct a, pct b) {
  return a.x > b.x || (a.x == b.x && a.y > b.y) || (a.x == b.x && a.y == b.y);
}
int indmi;
vector<pct> convex_hull(vector<pct>& a) {
  vector<pct> b;
  if (a.size() == 1) {
    indmi = a[0].ind;
    return a;
  }
  sort(a.begin(), a.end(), cmp);
  pct p1 = a[0], p2 = a.back();
  indmi = a[0].ind;
  vector<pct> up, down;
  up.push_back(p1);
  down.push_back(p1);
  for (int i = 1; i < a.size(); ++i) {
    if (i == a.size() - 1 || cw(p1, a[i], p2)) {
      while (up.size() >= 2 && !cw(up[up.size() - 2], up[up.size() - 1], a[i]))
        up.pop_back();
      up.push_back(a[i]);
    }
    if (i == a.size() - 1 || ccw(p1, a[i], p2)) {
      while (down.size() >= 2 &&
             !ccw(down[down.size() - 2], down[down.size() - 1], a[i]))
        down.pop_back();
      down.push_back(a[i]);
    }
  }
  for (size_t i = 0; i < up.size(); ++i) b.push_back(up[i]);
  for (size_t i = down.size() - 2; i > 0; --i) b.push_back(down[i]);
  return b;
}
map<pair<int, int>, vector<int> > h;
int main() {
  scanf("%d", &N);
  int indma = 1;
  for (int i = 1; i <= N; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    h[make_pair(a, b)].push_back(i);
    if (h[make_pair(a, b)].size() == 1) {
      if (i != indma && (b > v[indma - 1].y ||
                         (b == v[indma - 1].y && a >= v[indma - 1].x))) {
        indma = i;
      }
      v.push_back(pct(a, b, i));
    }
  }
  vector<pct> meh = convex_hull(v);
  bool ok = 0;
  for (auto z : meh) {
    if (z.ind == indmi) {
      ok = 1;
    }
    if (ok) {
      for (auto t : h[make_pair(z.x, z.y)]) {
        sol.push_back(t);
      }
      if (ok == 1 && z.ind == indma) break;
    }
  }
  sort(sol.begin(), sol.end());
  for (auto x : sol) printf("%d ", x);
  return 0;
}
