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;
int n, fa[210000];
struct Node {
  long long S, R, id;
  bool operator==(Node y) {
    if (S != y.S) return 0;
    if (R != y.R) return 0;
    return 1;
  }
} a[210000];
Node sta[210000];
int Lst[210000];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
long long CROSS_PRODUCT(Node p0, Node p1, Node p2) {
  return p1.S * p2.R * (p0.R - p1.R) * (p0.S - p2.S) -
         p1.R * p2.S * (p0.R - p2.R) * (p0.S - p1.S);
}
bool cmp(Node x, Node y) {
  long long temp = CROSS_PRODUCT(a[1], x, y);
  if (temp) return temp > 0;
  return x.R > y.R;
}
bool visited[210000];
int main() {
  scanf("%d", &n);
  int loc1 = 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%I64d%I64d", &a[i].R, &a[i].S);
    a[i].id = i;
    if (a[i].R > a[loc1].R)
      loc1 = i;
    else if (a[i].R == a[loc1].R && a[i].S > a[loc1].S)
      loc1 = i;
    fa[i] = i;
  }
  swap(a[loc1], a[1]);
  if (n >= 2) sort(a + 2, a + 1 + n, cmp);
  int cnt = 1;
  sta[1] = a[1];
  loc1 = 1;
  for (int i = 2; i <= n; ++i) {
    while (cnt > 1) {
      long long temp = CROSS_PRODUCT(sta[cnt - 1], sta[cnt], a[i]);
      if (temp < 0)
        --cnt;
      else if (temp == 0) {
        if (a[i] == sta[cnt]) {
          fa[find(a[i].id)] = find(sta[cnt].id);
          --cnt;
        } else if (sta[cnt].R == a[i].R || sta[cnt].S == a[i].S)
          --cnt;
        else
          break;
      } else
        break;
    }
    if (a[i] == sta[cnt])
      fa[find(a[i].id)] = find(sta[cnt].id);
    else
      sta[++cnt] = a[i];
  }
  int loc2 = cnt;
  for (int i = cnt; i >= 1; --i) {
    if (sta[i].S > sta[loc2].S)
      loc2 = i;
    else if (sta[i].S == sta[loc2].S && sta[i].R > sta[loc2].R)
      loc2 = i;
  }
  for (int i = loc1; i <= loc2; ++i) {
    visited[find(sta[i].id)] = 1;
  }
  bool flag = 0;
  for (int i = 1; i <= n; ++i)
    if (visited[find(i)]) {
      if (flag)
        printf(" %d", i);
      else
        printf("%d", i), flag = 1;
    }
  puts("");
  return 0;
}
