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;
int n, top, D, m;
struct Point {
  int idx;
  long long x, y;
  bool operator<(const Point &rhs) const {
    return x > rhs.x || x == rhs.x && y > rhs.y;
  }
} h[200200], p[200200];
bool cmp(Point a, Point b) { return a.idx < b.idx; }
vector<int> save[200200], ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    p[i].idx = i, scanf("%I64d%I64d", &p[i].x, &p[i].y);
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= n; i++)
    if (p[i].x == p[m].x && p[i].y == p[m].y)
      save[p[m].idx].push_back(p[i].idx);
    else
      p[++m] = p[i], save[p[i].idx].push_back(p[i].idx);
  D = 1;
  for (int i = 1; i <= m; i++)
    if (p[i].y > p[D].y) D = i;
  h[top = 1] = p[1];
  for (int i = 2; i <= D; i++) {
    while (top > 1) {
      Point a = h[top], b = h[top - 1], P = p[i];
      if ((a.y - P.y) * P.x * b.y * (b.x - a.x) <
          b.x * (b.y - a.y) * (a.x - P.x) * P.y)
        top--;
      else
        break;
    }
    h[++top] = p[i];
  }
  sort(h + 1, h + top + 1, cmp);
  for (int i = 1; i <= top; i++) {
    int sz = save[h[i].idx].size();
    for (int j = 0; j <= sz - 1; j++) ans.push_back(save[h[i].idx][j]);
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i <= ans.size() - 1; i++) printf("%d ", ans[i]);
}
