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;
struct ss {
  int s;
  int r;
  int p;
  int id;
} a[1000000], b[1000000];
bool cmp1(ss x, ss y) {
  if (x.s != y.s) return x.s < y.s;
  return x.r > y.r;
}
bool cmp2(ss x, ss y) {
  if (x.r != y.r) return x.r < y.r;
  return x.s > y.s;
}
bool cmp3(ss x, ss y) { return x.id < y.id; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a[i].s, &a[i].r);
    a[i].p = 0;
    a[i].id = i;
  }
  sort(a + 1, a + n + 1, cmp1);
  for (int i = 1; i <= n; i++) {
    int now = i + 1;
    while (a[i].s == a[now].s) {
      if (a[now].r < a[i].r) {
        a[now].p = 1;
      }
      now++;
    }
    i = now - 1;
  }
  sort(a + 1, a + n + 1, cmp2);
  for (int i = 1; i <= n; i++) {
    int now = i + 1;
    while (a[i].r == a[now].r) {
      if (a[now].s < a[i].s) {
        a[now].p = 1;
      }
      now++;
    }
    i = now - 1;
  }
  int num = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i].p == 0) {
      num++;
      b[num].s = a[i].s;
      b[num].p = 0;
      b[num].r = a[i].r;
      b[num].id = a[i].id;
    }
  }
  b[0].s = 0;
  b[0].r = 0;
  int now = num;
  for (int i = num - 1; i > 1; i--) {
    if (b[now].s > b[i].s) {
      b[i].p = 1;
    } else if (b[now].s == b[i].s) {
      if (b[now].r != b[i].r) {
        b[i].p = 1;
      }
    } else {
      now = i;
    }
  }
  sort(b + 1, b + num + 1, cmp3);
  int flag = 0;
  for (int i = 1; i <= num; i++) {
    if (b[i].p == 0) {
      if (flag == 1) {
        printf(" ");
      }
      flag = 1;
      printf("%d", b[i].id);
    }
  }
  printf("\n");
}
