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 double EPS = 1e-8;
struct Athlete {
  int x, y, id;
  Athlete(int x = 0, int y = 0, int id = 0) : x(x), y(y), id(id) {}
  int ccw(Athlete u, Athlete v) {
    return 1LL * (x - v.x) * (y - u.y) * u.x * v.y >
           1LL * (y - v.y) * (x - u.x) * v.x * u.y;
  }
};
int n, ans[200200];
Athlete a[200200];
bool cmp(Athlete u, Athlete v) {
  if (u.y == a[0].y && v.y == a[0].y) return u.x < v.x;
  if (u.y == a[0].y) return 1;
  if (v.y == a[0].y) return 0;
  long long lhs = 1LL * (a[0].x - u.x) * u.y * (a[0].y - v.y) * v.x;
  long long rhs = 1LL * (a[0].y - u.y) * u.x * (a[0].x - v.x) * v.y;
  if (lhs != rhs) return lhs > rhs;
  return u.x < v.x;
}
int main() {
  ios::sync_with_stdio(0);
  int s, r, lowest = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s >> r;
    a[i] = Athlete(s, r, i + 1);
    if (a[i].y > a[lowest].y || (a[i].y == a[lowest].y && a[i].x > a[lowest].x))
      lowest = i;
  }
  swap(a[0], a[lowest]);
  sort(a + 1, a + n, cmp);
  vector<Athlete> hull;
  hull.push_back(a[0]);
  hull.push_back(a[1]);
  for (int i = 2; i < n; i++) {
    while (hull.size() > 1 && !hull[hull.size() - 2].ccw(hull.back(), a[i]))
      hull.pop_back();
    hull.push_back(a[i]);
  }
  int leftmost = 0;
  for (int i = 1; i < hull.size(); i++)
    if (a[i].x > a[leftmost].x ||
        (a[i].x == a[leftmost].x && a[i].y > a[leftmost].y))
      leftmost = i;
  while (leftmost && leftmost < hull.size()) ans[a[leftmost++].id] = 1;
  ans[a[0].id] = 1;
  for (int i = 1; i <= n; i++)
    if (ans[i]) cout << i << ' ';
}
