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;
struct whs {
  double x, y;
  long long id;
  friend bool operator<(const whs &a, const whs &b) {
    return a.x == b.x ? a.y < b.y : a.x < b.x;
  }
} node[555555], p[555555];
vector<long long> id[555555];
vector<long long> ans;
long long n, m = 1, top;
long long sta[555555];
double cal(long long a, long long b) {
  return ((p[a].y - p[b].y) / ((p[a].x - p[b].x)));
}
int main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) {
    scanf("%lf%lf", &node[i].x, &node[i].y);
    node[i].x = 1 / node[i].x;
    node[i].y = 1 / node[i].y;
    node[i].id = i;
  }
  sort(node + 1, node + n + 1);
  p[1] = node[1];
  m = 1;
  for (long long i = 2; i <= n; ++i) {
    if (fabs(node[i].x - node[i - 1].x) > 1e-9)
      p[++m] = node[i];
    else if (fabs(node[i].y - p[m].y) <= 1e-9)
      id[p[m].id].push_back(node[i].id);
  }
  sta[1] = 1, sta[2] = 2;
  top = 2;
  for (long long i = 3; i <= m; i++) {
    while (top > 1 && cal(sta[top - 1], sta[top]) > cal(sta[top - 1], i)) top--;
    sta[++top] = i;
  }
  ans.push_back(p[sta[1]].id);
  for (long long j = 0; j < id[p[sta[1]].id].size(); j++)
    ans.push_back(id[p[sta[1]].id][j]);
  for (long long i = 2; i <= top; i++) {
    if (cal(sta[i - 1], sta[i]) < 0) {
      ans.push_back(p[sta[i]].id);
      for (long long j = 0; j < id[p[sta[i]].id].size(); j++) {
        ans.push_back(id[p[sta[i]].id][j]);
      }
    } else
      break;
  }
  sort(ans.begin(), ans.end());
  for (long long i = 0; i < ans.size(); i++) {
    printf("%lld ", ans[i]);
  }
  printf("\n");
}
