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 <cstdio>
#include <algorithm>
#define pii pair<int, int>
#define r first
#define s second
using namespace std;

const int MAXN = 2e5;

int q[MAXN], p[MAXN], Q, N;
pii a[MAXN];
vector<int> r;

double sec(int i, int j) {
	return 1.0*a[i].r*a[j].r*(a[i].s-a[j].s)/(a[i].s*a[j].s*(a[j].r-a[i].r));
}

int main() {
	// freopen("C.in", "r", stdin);
	scanf("%d", &N);
	for(int i = 0; i < N; ++i) {
		scanf("%d%d", &a[i].r, &a[i].s);
		p[i] = i;
	}

	sort(p, p+N, [](int i, int j) {
		return a[i] < a[j];
	});

	for(int i = 0; i < N; ++i) {
		// printf("a = %d %d\n", a[p[i]].r, a[p[i]].s);
		if(Q && a[p[i]].r == a[p[q[Q-1]]].r) {
			if(a[p[i]].s == a[p[q[Q-1]]].s)
				q[Q++] = i;
			else if(a[p[i]].s > a[p[q[Q-1]]].s) {
				while(Q && a[p[i]].r == a[p[q[Q-1]]].r)
					--Q;
				q[Q++] = i;
			}
		} else {
			while(Q > 1 && sec(p[q[Q-2]], p[i]) + 1e-6 < sec(p[q[Q-2]], p[q[Q-1]]))
				--Q;
			q[Q++] = i;
		}
		// printf("Q = ");for(int i = 0; i < Q; ++i)
		// 	printf("%d ", q[i]); puts("");
	}

	for(int i = 0; i < Q; ++i)
		r.push_back(p[q[i]]);
	sort(r.begin(), r.end());

	for(int x: r)
		printf("%d ", x+1);
	puts("");
}