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>
struct Point {
  Point(long long r, long long s, int idx) : x(r), y(s), index(idx) {}
  long long x;
  long long y;
  int index;
};
long long cross_product(Point p1, Point p2, Point p3) {
  return (p2.x - p1.x) * (p3.y - p1.y) - (p3.x - p1.x) * (p2.y - p1.y);
}
int main() {
  int n;
  std::cin >> n;
  std::vector<Point> points1;
  for (int i = 0; i < n; i++) {
    long long x1, y1;
    std::cin >> x1 >> y1;
    points1.push_back(Point(x1, y1, i + 1));
  }
  long long maxY(0), maxYx(0);
  long long maxX(0), maxXy(0);
  int my, mx;
  for (int i = 0; i < points1.size(); i++) {
    if (points1[i].y > maxY) {
      maxY = points1[i].y;
      maxYx = points1[i].x;
      my = points1[i].index;
    }
    if (points1[i].x > maxX) {
      maxX = points1[i].x;
      maxXy = points1[i].y;
      mx = points1[i].index;
    }
  }
  std::vector<Point> points;
  while (points1.size() > 0) {
    if (points1.back().x <= maxYx || points1.back().y <= maxXy)
      points1.pop_back();
    else {
      points.push_back(points1.back());
      points1.pop_back();
    }
  }
  points.push_back(Point(maxYx, maxY, my));
  if (my != mx) points.push_back(Point(maxX, maxXy, mx));
  Point origin(maxYx, maxXy, -1);
  std::vector<Point> final;
  if (points.size() < 4) {
    final.push_back(origin);
    for (auto p : points) {
      final.push_back(p);
    }
  } else {
    std::sort(points.begin(), points.end(), [=](Point a, Point b) {
      return cross_product(origin, b, a) > 0;
    });
    final.push_back(origin);
    final.push_back(points[0]);
    for (int i = 2; i < points.size(); i++) {
      while (final.size() >= 2 && cross_product(final[final.size() - 2],
                                                final.back(), points[i]) > 0)
        final.pop_back();
      final.push_back(points[i]);
    }
  }
  std::sort(final.begin(), final.end(),
            [](Point a, Point b) { return a.index < b.index; });
  for (int i = 1; i < final.size() - 1; i++) std::cout << final[i].index << " ";
  std::cout << final.back().index << std::endl;
  return 0;
}
