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 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int x[N], y[N], n;
pair<int, int> p[N], ch[N];
set<pair<int, int> > s;
bool cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) return a.second > b.second;
  return a.first > b.first;
}
bool cross(pair<int, int> p1, pair<int, int> p2, pair<int, int> pi) {
  pair<double, double> tmp1 = {
      10000.0 * (p2.first - p1.first) / (p1.first * p2.first),
      10000.0 * (p2.second - p1.second) / (p1.second * p2.second)};
  pair<double, double> tmp2 = {
      10000.0 * (p2.first - pi.first) / (pi.first * p2.first),
      10000.0 * (p2.second - pi.second) / (pi.second * p2.second)};
  return (tmp1.first * tmp2.second - tmp1.second * tmp2.first) < 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", x + i, y + i);
    p[i] = {x[i], y[i]};
  }
  sort(p, p + n, cmp);
  int tot = 1, top = 0;
  for (int i = 1; i < n; ++i)
    if (p[i].second > p[tot - 1].second) p[tot++] = p[i];
  for (int i = 0; i < tot; i++) {
    while (top > 1 && cross(ch[top - 1], ch[top - 2], p[i])) top--;
    ch[top++] = p[i];
  }
  for (int i = 0; i < top; i++) s.insert(ch[i]);
  for (int i = 0; i < n; i++)
    if (s.find({x[i], y[i]}) != s.end()) printf("%d ", i + 1);
}
