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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
map<pair<int, int>, int> mp;
int n, q[200000 + 5], Ans[200000 + 5], top, flag[200000 + 5];
struct hito {
  double a, b;
  int id;
} s[200000 + 5];
bool cmp(const hito& x, const hito& y) {
  return x.a == y.a ? x.b < y.b : x.a < y.a;
}
inline double Calc(int x, int y) {
  return (s[x].b - s[y].b) / (s[x].a - s[y].a);
}
int main() {
  n = read();
  int num = 0;
  for (int i = 1; i <= n; ++i) {
    int x = read(), y = read();
    if (mp[make_pair(x, y)])
      flag[i] = mp[make_pair(x, y)];
    else
      mp[make_pair(x, y)] = i, s[++num] = (hito){1. / x, 1. / y, i};
  }
  sort(s + 1, s + num + 1, cmp);
  double mn = 1e9;
  for (int i = 1; i <= num; ++i)
    if (s[i].b < mn) {
      while (top > 1 && Calc(q[top], q[top - 1]) > Calc(i, q[top])) --top;
      q[++top] = i;
      mn = s[i].b;
    }
  for (int i = 1; i <= top; ++i) Ans[s[q[i]].id] = 1;
  for (int i = 1; i <= n; ++i)
    if (flag[i] ? Ans[flag[i]] : Ans[i]) printf("%d ", i);
  return 0;
}
