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>
using namespace std;
int n;
struct Node {
  double a, b;
  int id;
} poi[200200];
bool cmp(Node a, Node b) { return a.a < b.a || a.a == b.a && a.b < b.b; }
int fa[200200];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
int sta[200200], top;
Node en[200200];
double sl(Node x, Node y) { return (x.b - y.b) / (x.a - y.a); }
bool book[200200];
int main() {
  scanf("%d", &n);
  int a, b;
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &a, &b);
    poi[i].a = 100.00 / a;
    poi[i].b = 100.00 / b;
    poi[i].id = i;
    fa[i] = i;
  }
  sort(poi + 1, poi + n + 1, cmp);
  int tn = n, n = 0;
  for (int i = 1; i <= tn; ++i) {
    if (poi[i].a == poi[n].a && poi[i].b == poi[n].b) {
      fa[find(poi[i].id)] = find(poi[n].id);
      continue;
    }
    if (poi[i].a == poi[n].a) continue;
    poi[++n] = poi[i];
  }
  for (int i = 1; i <= n; ++i) {
    if (!top) {
      sta[++top] = i;
      continue;
    }
    while (top > 1 &&
           sl(poi[i], poi[sta[top - 1]]) < sl(poi[sta[top]], poi[sta[top - 1]]))
      top--;
    sta[++top] = i;
  }
  for (int i = 1; i <= top; ++i) {
    en[i] = poi[sta[i]];
  }
  book[find(en[1].id)] = 1;
  for (int i = 1; i < top; ++i)
    if (sl(en[i], en[i + 1]) < 0) {
      book[find(en[i].id)] = book[find(en[i + 1].id)] = 1;
    }
  for (int i = 1; i <= tn; ++i)
    if (book[find(i)]) printf("%d ", i);
  puts("");
  return 0;
}
