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 dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
void Duxar(int _this_line) {}
template <class T>
void ReadNo(T &_value) {
  T _sign = 1;
  char ch;
  _value = 0;
  while (!isdigit(ch = getchar())) {
    (ch == '-') && (_sign = -1);
  }
  do {
    _value = _value * 10 + (ch - '0');
  } while (isdigit(ch = getchar()));
  _value *= _sign;
}
class Point {
 public:
  double first, second, pos;
  Point(double x, double y, double p) {
    first = x;
    second = y;
    pos = p;
  }
  pair<double, double> get_pair() { return make_pair(first, second); }
};
bool operator>(Point a, Point b) {
  return make_pair(a.first, a.second) > make_pair(b.first, b.second);
}
bool operator<(Point a, Point b) {
  return make_pair(a.first, a.second) < make_pair(b.first, b.second);
}
void ReadNo(Point &_value) {
  ReadNo(_value.first);
  ReadNo(_value.second);
}
int N;
vector<Point> points;
map<pair<double, double>, vector<int> > saved;
double CrossProduct(Point p3, Point p1, Point p2) {
  return (p1.second - p3.second) * (p2.first - p3.first) -
         (p1.first - p3.first) * (p2.second - p3.second);
}
bool ByCrossProduct(Point p1, Point p2) {
  return CrossProduct(points[0], p1, p2) < 0;
}
int main() {
  string file_input = "zzzzzzzz";
  int i, p = 0, pos = 0, f = 0;
  double x, y;
  vector<int> hull, answer;
  ReadNo(N);
  hull.resize(N);
  for (i = 0; i < N; ++i) {
    ReadNo(x);
    ReadNo(y);
    x = (double)1 / x;
    y = (double)1 / y;
    if (saved.find(make_pair(x, y)) == saved.end()) {
      points.push_back(Point(x, y, i));
      if (points[pos] < points[p]) {
        p = pos;
      }
      if (points[pos].second < points[f].second ||
          (points[pos].second == points[f].second &&
           points[pos].first < points[f].first)) {
        f = pos;
      }
      ++pos;
    }
    saved[make_pair(x, y)].push_back(i);
  }
  f = points[f].pos;
  swap(points[p], points[0]);
  sort(points.begin() + 1, points.end(), ByCrossProduct);
  hull[0] = 0;
  p = 0;
  for (i = 1; i < pos && f != points[hull[0]].pos; ++i) {
    while (p > 0 && CrossProduct(points[p - 1], points[p], points[i]) > 0) {
      --p;
    }
    ++p;
    hull[p] = i;
    if (points[i].pos == f) {
      break;
    }
  }
  for (; p >= 0; --p) {
    for (auto x : saved[points[hull[p]].get_pair()]) {
      answer.push_back(x);
    }
  }
  sort((answer).begin(), (answer).end());
  for (auto x : answer) {
    printf("%d ", x + 1);
  }
  return 0;
}
