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 
5
10 50
10 50
10 50
10 50
10 50
 2
10000 10000
10000 10000
 3
10000 10000
10000 10000
10000 10000
 3
1000 3000
1500 1500
3000 1000
 43
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 1
1 1
 2
1 1
1 1
 44
78 52
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 3
1000 3000
1499 1499
3000 1000
 5
50 50
49 50
50 49
49 49
50 1
 18
82 38
33 69
33 69
33 69
33 69
33 69
82 38
33 69
33 69
33 69
82 38
33 69
33 69
82 38
82 38
33 69
33 69
33 69
 1
10000 9999
 3
1000 3000
1501 1501
3000 1000
 2
1 2
2 1

1 2 3 4 5
 1 2
 1 2 3
 1 2 3
 1 3 16 24 29 31 32 37 41 42
 1
 1 2
 1
 1 3
 1
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 1
 1 2 3
 1 2 

#include <bits/stdc++.h>
template <typename T>
void read(T &);
template <typename T>
void write(const T &);
const int iinf = 2147483647;
const long long llinf = 9223372036854775807ll;
constexpr int N = 200005;
class Point {
 public:
  int x, y, id;
} p[N];
long double qwq(Point i, Point j);
std::vector<int> G[N];
int a[N], b[N];
int sta[N], top;
int ans[N], tot;
int n;
int main() {
  read(n);
  for (int i = 1; i <= n; ++i) {
    read(p[i].x), read(p[i].y);
    p[i].id = i;
  }
  std::sort(p + 1, p + n + 1, [&](Point i, Point j) {
    if (i.x == j.x) {
      return i.y > j.y;
    }
    return i.x > j.x;
  });
  int num = 0;
  for (int i = 1, j = 1; i <= n; i = j = j + 1) {
    while (j < n && p[j + 1].x == p[i].x) {
      ++j;
    }
    ++num;
    for (int k = i; k <= j; ++k) {
      if (p[k].y == p[i].y) {
        G[num].push_back(p[k].id);
      }
    }
    p[num] = Point{p[i].x, p[i].y, num};
  }
  for (int i = 1; i <= num; ++i) {
    if (qwq(p[sta[top]], p[i]) > 0) {
      continue;
    }
    while (top > 1 &&
           qwq(p[sta[top]], p[i]) < qwq(p[sta[top - 1]], p[sta[top]])) {
      --top;
    }
    sta[++top] = i;
  }
  for (int i = 1; i <= top; ++i) {
    for (int j : G[p[i].id]) {
      ans[++tot] = j;
    }
  }
  std::sort(ans + 1, ans + tot + 1);
  for (int i = 1; i <= tot; ++i) {
    write(ans[i]), putchar(' ');
  }
  putchar('\n');
  return 0;
}
long double qwq(Point i, Point j) {
  return static_cast<long double>(i.x) * j.x * (i.y - j.y) / i.y / j.y /
         (i.x - j.x);
}
template <typename T>
inline void read(T &Re) {
  T k = 0;
  char ch = getchar();
  int flag = 1;
  while (!(ch >= '0' && ch <= '9')) {
    if (ch == '-') {
      flag = -1;
    }
    ch = getchar();
  }
  while ((ch >= '0' && ch <= '9')) {
    k = (k << 1) + (k << 3) + ch - '0';
    ch = getchar();
  }
  Re = flag * k;
}
template <typename T>
inline void write(const T &Wr) {
  if (Wr < 0) {
    putchar('-');
    write(-Wr);
  } else {
    if (Wr < 10) {
      putchar(Wr + '0');
    } else {
      write(Wr / 10);
      putchar((Wr % 10) + '0');
    }
  }
}
