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 int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
struct Frac {
  long long int up, down;
  Frac() : up(), down() {}
  Frac(long long int a, long long int b = 1) : up(a), down(b) { normalize(); }
  void normalize() {
    if (down < 0) {
      up *= -1;
      down *= -1;
    }
  }
  bool operator==(const Frac &other) const {
    return up * other.down == other.up * down;
  }
  bool operator!=(const Frac &other) const { return !(*this == other); }
  bool operator<(const Frac &other) const {
    return up * other.down - other.up * down < 0;
  }
  bool operator>(const Frac &other) const {
    return up * other.down - other.up * down > 0;
  }
  Frac operator*(Frac other) { return Frac(up * other.up, down * other.down); }
  Frac operator+(Frac other) {
    return Frac(up * other.down + other.up * down, down * other.down);
  }
  Frac operator-(Frac other) {
    return Frac(up * other.down - other.up * down, down * other.down);
  }
};
struct Point {
  Frac x, y;
  Point() : x(), y() {}
  Point(Frac a, Frac b) : x(a), y(b) {}
  bool operator==(const Point &other) const {
    return x == other.x && y == other.y;
  }
  bool operator<(const Point &other) const {
    if (x != other.x) return x < other.x;
    return y < other.y;
  }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Frac operator*(Point p) { return x * p.y - y * p.x; }
  Frac operator%(Point p) { return x * p.x + y * p.y; }
  Frac length2() { return *this % *this; }
  void print() {
    printf("(%lld/%lld, %lld/%lld)\n", x.up, x.down, y.up, y.down);
  }
};
void print(vector<Point> list) {
  printf("-----\n");
  for (auto p : list) p.print();
  printf("\n");
}
vector<Point> comp(const vector<Point> &list) {
  Point L = list[0];
  Point D = list[0];
  for (auto p : list) {
    if (p.x < L.x || (p.x == L.x && p.y < L.y)) L = p;
    if (p.y < D.y || (p.y == D.y && p.x < D.x)) D = p;
  }
  vector<Point> res;
  res.reserve(list.size());
  for (auto p : list) {
    if (p.x == L.x && p.y > L.y) continue;
    if (p.y == D.y && p.x > D.x) continue;
    res.push_back(p);
  }
  res.push_back(Point(L.x, 2));
  res.push_back(Point(2, 2));
  res.push_back(Point(2, D.y));
  sort(res.begin(), res.end());
  res.erase(unique(res.begin(), res.end()), res.end());
  return res;
}
Point null_point;
bool cmp(Point A, Point B) {
  Point va = A - null_point;
  Point vb = B - null_point;
  Frac mul = va * vb;
  if (mul != Frac(0)) return mul < Frac(0);
  return va.length2() < vb.length2();
}
vector<Point> build_hull(vector<Point> &list) {
  int ind = max_element(list.begin(), list.end()) - list.begin();
  swap(list[0], list[ind]);
  null_point = list[0];
  sort(list.begin() + 1, list.end(), cmp);
  vector<Point> hull;
  hull.reserve(list.size());
  for (auto C : list) {
    while ((int)hull.size() >= 2) {
      Point B = hull[(int)hull.size() - 1];
      Point A = hull[(int)hull.size() - 2];
      if ((B - A) * (C - A) > 0)
        hull.pop_back();
      else
        break;
    }
    hull.push_back(C);
  }
  return hull;
}
int main() {
  int n;
  scanf("%d", &n);
  vector<Point> list(n);
  for (int i = 0; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    list[i] = Point(Frac(1, a), Frac(1, b));
  }
  vector<Point> comp_list = comp(list);
  vector<Point> hull = build_hull(comp_list);
  sort(hull.begin(), hull.end());
  for (int i = 0; i < n; i++)
    if (binary_search(hull.begin(), hull.end(), list[i])) printf("%d ", i + 1);
  return 0;
}
