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 MaxA = 2e5 + 7;
struct Point {
  int id;
  long long x, y;
  Point() {}
  Point(int x, int y) : x(x), y(y) {}
  bool operator==(const Point& rhs) const { return x == rhs.x && y == rhs.y; }
} p[MaxA];
int N;
int stk[MaxA], top;
int ans[MaxA], num;
bool cmp(const Point& A, const Point& B) {
  return A.x > B.x || (A.x == B.x && A.y > B.y);
}
bool judge(Point a, Point b, Point o) {
  return b.x * (o.x - a.x) * a.y * (o.y - b.y) <
         a.x * (o.x - b.x) * b.y * (o.y - a.y);
}
int main() {
  while (~scanf("%d", &N)) {
    for (int i = 0; i < N; i++) {
      scanf("%I64d%I64d", &p[i].x, &p[i].y);
      p[i].id = i + 1;
    }
    sort(p, p + N, cmp);
    top = 0;
    for (int i = 0; i < N; i++) {
      if (top >= 1 && p[i].y <= p[stk[top]].y) continue;
      while (top >= 2 && judge(p[stk[top]], p[i], p[stk[top - 1]])) top--;
      stk[++top] = i;
    }
    num = 0;
    int pos = 0;
    for (int i = 1; i <= top && pos < N; i++) {
      while (pos < N && cmp(p[pos], p[stk[i]])) pos++;
      while (pos < N && p[pos] == p[stk[i]]) ans[num++] = p[pos++].id;
    }
    sort(ans, ans + num);
    for (int i = 0; i < num; i++) {
      printf("%d%c", ans[i], " \n"[i == num - 1]);
    }
  }
  return 0;
}
