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>
struct point {
  double x, y;
  int id;
  inline bool operator<(const point& rhs) const {
    return (x != rhs.x) ? (x < rhs.x) : (y < rhs.y);
  }
} q[200005], p[200005];
int n, m;
int sta[200005], top;
std::vector<int> v, id[200005];
inline double slope(int a, int b) {
  return ((p[a].y - p[b].y) / (p[a].x - p[b].x));
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    q[i] = (point){1. / a, 1. / b, i};
  }
  std::sort(q + 1, q + n + 1);
  p[1] = q[1];
  m = 1;
  for (int i = 2; i <= n; ++i)
    if (fabs(q[i].x - q[i - 1].x) > 1e-9)
      p[++m] = q[i];
    else if (fabs(q[i].y - p[m].y) <= 1e-9)
      id[p[m].id].push_back(q[i].id);
  if (m == 1) {
    v.push_back(p[1].id);
    for (int i : id[p[1].id]) v.push_back(i);
    std::sort(v.begin(), v.end());
    for (int i : v) printf("%d ", i);
    return 0;
  }
  sta[1] = 1, sta[2] = 2;
  top = 2;
  for (int i = 3; i <= m; ++i) {
    while (top > 1 && slope(sta[top - 1], sta[top]) > slope(sta[top - 1], i))
      --top;
    sta[++top] = i;
  }
  v.push_back(p[sta[1]].id);
  for (int i : id[p[sta[1]].id]) v.push_back(i);
  for (int i = 2; i <= top; ++i)
    if (slope(sta[i - 1], sta[i]) < 0) {
      v.push_back(p[sta[i]].id);
      for (int j : id[p[sta[i]].id]) v.push_back(j);
    } else
      break;
  std::sort(v.begin(), v.end());
  for (int i : v) printf("%d ", i);
  return 0;
}
