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;
}
int N;
map<pair<int, int>, vector<int> > saved;
vector<pair<int, int> > points, hull;
pair<int, int> ru, ur;
vector<int> answer;
bool MostRightUpB(pair<int, int> a, pair<int, int> b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
bool MostUpRightB(pair<int, int> a, pair<int, int> b) {
  return a.second < b.second || (a.second == b.second && a.first < b.first);
}
long long CrossProduct(pair<int, int> o, pair<int, int> a, pair<int, int> b) {
  return ((long long)a.second * b.first * o.first * o.second -
          (long long)a.second * o.first * b.first * b.second -
          (long long)o.second * b.first * a.first * a.second +
          (long long)a.first * b.first * a.second * b.second) -
         ((long long)a.first * b.second * o.first * o.second -
          (long long)a.first * o.second * b.first * b.second -
          (long long)o.first * b.second * a.first * a.second +
          (long long)a.first * b.first * a.second * b.second);
}
long long DistanceBetw(pair<int, int> a, pair<int, int> b) {
  long long t1 = a.second - b.second;
  long long t2 = a.first - b.first;
  return t1 * t1 + t2 * t2;
}
bool ByCrossProduct(pair<int, int> a, pair<int, int> b) {
  long long cp = CrossProduct(ru, a, b);
  if (!cp) {
    return DistanceBetw(ru, a) < DistanceBetw(ru, b);
  }
  return cp < 0;
}
int main() {
  string file_input = "zzzzzzzz";
  int i, x, y, nr_points, p;
  ReadNo(N);
  hull.resize(N);
  for (i = 0; i < N; ++i) {
    ReadNo(x);
    ReadNo(y);
    saved[make_pair(x, y)].push_back(i + 1);
  }
  if (saved.size() == 1) {
    sort((saved.begin()->second).begin(), (saved.begin()->second).end());
    for (auto pos : saved.begin()->second) {
      printf("%d ", pos);
    }
    return 0;
  }
  nr_points = saved.size();
  points.resize(nr_points);
  i = 0;
  for (auto x : saved) {
    pair<int, int> p = x.first;
    points[i++] = p;
    if (MostRightUpB(ru, p)) {
      ru = p;
    }
    if (MostUpRightB(ur, p)) {
      ur = p;
    }
  }
  if (ru == ur) {
    sort((saved[ru]).begin(), (saved[ru]).end());
    for (auto pos : saved[ru]) {
      printf("%d ", pos);
    }
    return 0;
  }
  swap(ru, ur);
  sort((points).begin(), (points).end(), ByCrossProduct);
  hull[0] = ru;
  p = 0;
  for (i = 1; i < nr_points && points[i] != ur; ++i) {
    while (p > 0 && CrossProduct(hull[p - 1], hull[p], points[i]) > 0) {
      --p;
    }
    ++p;
    hull[p] = points[i];
  }
  hull[++p] = ur;
  for (auto p : hull) {
    for (auto pos : saved[p]) {
      answer.push_back(pos);
    }
  }
  sort((answer).begin(), (answer).end());
  for (auto x : answer) {
    printf("%d ", x);
  }
  return 0;
}
