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;
const int MN = 1e4 + 100;
const double E = 0.0000000001;
struct {
  double r;
  vector<int> index;
  ;
} compet[MN];
int ans[MN];
int ansPos = 0;
double lo[MN];
double hi[MN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < MN; ++i) {
    compet[i].r = 0;
    hi[i] = 1;
  }
  for (int i = 0; i < n; ++i) {
    int s, r;
    scanf("%d %d", &s, &r);
    if (compet[s].r == (double)r) {
      compet[s].index.push_back(i + 1);
    } else if (compet[s].r < r) {
      compet[s].r = r;
      compet[s].index.clear();
      compet[s].index.push_back(i + 1);
    }
  }
  for (int i = 0; i < MN; ++i) {
    if (compet[i].index.size() == 0) continue;
    double q = 1 / compet[i].r;
    double w = 1 / (double)i - 1 / compet[i].r;
    double qq, ww;
    for (int j = i + 1; j < MN; ++j) {
      if (compet[j].index.size() == 0) continue;
      qq = q - 1 / compet[j].r;
      ww = w - 1 / (double)j + 1 / compet[j].r;
      if (abs(ww) < E) {
        if (qq > 0) {
          hi[i] = -1;
        } else {
          hi[j] = -1;
        }
      } else {
        qq /= -ww;
        if (ww > 0) {
          hi[i] = min(hi[i], qq);
          lo[j] = max(lo[j], qq);
        } else {
          lo[i] = max(lo[i], qq);
          hi[j] = min(hi[j], qq);
        }
      }
    }
    if (hi[i] > lo[i] + E ||
        (abs(hi[i] - lo[i]) < E && lo[i] > 0 && lo[i] < 1)) {
      for (int x : compet[i].index) {
        ans[ansPos++] = x;
      }
    }
  }
  sort(ans, ans + ansPos);
  for (int i = 0; i < ansPos; ++i) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
