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;
const int iinf = 1e9 + 7;
const long long linf = 1ll << 60;
const double dinf = 1e60;
template <typename T>
inline void scf(T &x) {
  bool f = 0;
  x = 0;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') {
    f = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  if (f) x = -x;
  return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) {
  scf(x);
  return scf(y);
}
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) {
  scf(x);
  scf(y);
  return scf(z);
}
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
  scf(x);
  scf(y);
  scf(z);
  return scf(w);
}
inline char mygetchar() {
  char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
template <typename T>
void chkmax(T &x, const T &y) {
  if (y > x) x = y;
  return;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
  return;
}
const int N = 2e5 + 100;
struct point {
  long long x, y;
  bool operator<(const point &a) const {
    return make_pair(x, y) < make_pair(a.x, a.y);
  }
  bool operator==(const point &a) const {
    return make_pair(x, y) == make_pair(a.x, a.y);
  }
} a[N], b[N];
int n, stk[N], top;
set<point> all;
void TZL() {
  scf(n);
  for (int i = (1); i <= (n); ++i) {
    long long x, y;
    scf(x, y);
    a[i].x = x;
    a[i].y = y;
    b[i].x = x;
    b[i].y = y;
  }
  sort(b + 1, b + n + 1,
       [&](point a, point b) { return a.x == b.x ? a.y > b.y : a.x > b.x; });
  return;
}
bool check(int i, int j, int k) {
  point a = b[i], b = ::b[j], c = ::b[k];
  return a.x * a.y * c.y * b.x + a.y * b.x * b.y * c.x + a.x * b.y * c.x * c.y >
         a.x * a.y * c.x * b.y + a.x * b.x * b.y * c.y + a.y * b.x * c.x * c.y;
}
void RANK1() {
  stk[top++] = 1;
  for (int i = (2); i <= (n); ++i)
    if (b[i].y > b[stk[top - 1]].y) {
      while (top > 1 && check(stk[top - 2], stk[top - 1], i)) --top;
      stk[top++] = i;
    }
  for (int i = 0; i < (top); ++i) all.insert(b[stk[i]]);
  for (int i = (1); i <= (n); ++i)
    if (all.find(a[i]) != all.end()) printf("%d ", i);
  return;
}
int main() {
  TZL();
  RANK1();
  return 0;
}
