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 cc = getchar();
  while (cc > '9' || cc < '0') {
    if (cc == '-') f = -1;
    cc = getchar();
  }
  while (cc >= '0' && cc <= '9') {
    x = (x << 1) + (x << 3) + cc - '0';
    cc = getchar();
  }
  return x * f;
}
const int maxn = 1000005;
struct node {
  int x, y, i;
  double a, b;
} s[maxn], sta[maxn];
bool ans[maxn];
inline bool comp(node a, node b) { return a.y == b.y ? a.x > b.x : a.y < b.y; }
inline bool cmp(node a, node b) { return a.i < b.i; }
inline double check(node a, node b) { return -(a.b - b.b) / (a.a - b.a); }
map<pair<double, double>, bool> mp;
int main() {
  int n = read();
  for (int i = 1; i <= n; ++i) {
    s[i].x = read();
    s[i].y = read();
    s[i].i = i;
    s[i].a = 1e9 / s[i].y;
    s[i].b = 1e9 / s[i].x;
  }
  sort(s + 1, s + n + 1, comp);
  int top = 0;
  sta[++top] = (node){0, 0, 0, 1e18, 0};
  for (int i = 1; i <= n; ++i) {
    if (s[i].y == s[i - 1].y) continue;
    while (top > 1 && sta[top].y != sta[top - 1].y &&
           check(s[i], sta[top]) + 1e-15 < check(sta[top], sta[top - 1]))
      --top;
    sta[++top] = s[i];
  }
  sort(s + 1, s + n + 1, cmp);
  for (int i = 1; i <= top; i++) mp[make_pair(sta[i].a, sta[i].b)] = 1;
  for (int i = 1; i <= n; i++)
    if (mp[make_pair(s[i].a, s[i].b)]) printf("%d ", s[i].i);
  puts("");
  return 0;
}
