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 maxn = 2e5 + 100;
struct Point {
  long long x, y;
  bool operator<(const Point &p) const {
    if (x != p.x)
      return x > p.x;
    else
      return y > p.y;
  }
} pt[maxn];
int stk[maxn], stnum;
set<pair<long long, long long> > has;
bool check(Point a, Point b, Point c) {
  return c.x * b.y * (b.x - a.x) * (a.y - c.y) <
         b.x * c.y * (a.x - c.x) * (b.y - a.y);
}
void convex(int n) {
  int i, j;
  stnum = 0;
  for (i = 0; i < n; i++) {
    if (stnum > 0 && pt[i].y <= pt[stk[stnum - 1]].y) continue;
    while (stnum > 1 && check(pt[stk[stnum - 1]], pt[stk[stnum - 2]], pt[i]))
      stnum--;
    stk[stnum++] = i;
  }
  while (stnum > 1 && pt[stk[stnum - 1]].y <= pt[stk[stnum - 2]].y) stnum--;
  for (i = 0; i < stnum - 1; i++)
    if (pt[stk[i]].x != pt[stk[i + 1]].x) break;
  for (; i < stnum; i++) has.insert(make_pair(pt[stk[i]].x, pt[stk[i]].y));
}
long long a[maxn], b[maxn];
int main() {
  int n, i, j;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%I64d %I64d", &a[i], &b[i]);
    pt[i].x = a[i];
    pt[i].y = b[i];
  }
  sort(pt, pt + n);
  convex(n);
  for (i = 0; i < n; i++) {
    if (has.find(make_pair(a[i], b[i])) != has.end()) printf("%d ", i + 1);
  }
  printf("\n");
  return 0;
}
