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>

double const EPS = 1e-8;

struct Point {
	double x, y;
	int id;
	
	Point() {}
	
	Point(double const & x, double const & y, int id) : x(x), y(y), id(id) {}
	
	Point & operator -= (Point const & a) {
		x = x - a.x;
		y = y - a.y;
		return *this;
	}
	
	Point operator - (Point const & a) const {
		return Point(x - a.x, y - a.y, -1);
	}
	
	Point & operator += (Point const & a) {
		x = x + a.x;
		y = y + a.y;
		return *this;	
	}
	
	double operator * (Point const & a) const {
		return x * a.y - y * a.x;
	}
	
	bool operator < (Point const & a) const {
		double mul = (*this) * a;
		if (fabs(mul) > EPS) {
			return mul > EPS;
		}
		return len2() < a.len2() - EPS;
	}
	
	bool operator > (Point const & a) const {
		double mul = (*this) * a;
		if (fabs(mul) > EPS) {
			return mul < -EPS;
		}
		return len2() > a.len2() + EPS;
	}
	
	double len2() const {
		return x * x + y * y;
	}
	
	bool better_than(Point const & a) const {
		if (fabs(x - a.x) > EPS) {
			return x < a.x - EPS;
		}
		return y < a.y - EPS;
	}
	
	bool cooler_than(Point const & a) const {
		if (fabs(y - a.y) > EPS) {
			return y < a.y - EPS;
		}
		return x < a.x + EPS;
	}
};

Point p[300100];
Point st[300100];
int ans[300100];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) {
		int r, s;
		scanf("%d%d", &r, &s);
		p[i] = Point(1. / r, 1. / s, i);
	}
	int mi = 0;
	for (int i = 1; i < n; ++i) {
		if (p[i].better_than(p[mi])) {
			mi = i;
		}
	}
	std::swap(p[mi], p[0]);
	for (int i = 1; i < n; ++i) {
		p[i] -= p[0];
	}
	std::sort(p + 1, p + n);
	for (int i = 1; i < n; ++i) {
		p[i] += p[0];
	}
//	for (int i = 0; i < n; ++i) fprintf(stderr, "%d ", p[i].id); fprintf(stderr, "\n");
	int sz = 0;
	for (int i = 0; i < n; ++i) {
		while (sz > 2 && (st[sz - 1] - st[sz - 2]) > (p[i] - st[sz - 1])) {
			sz--;
		}
		st[sz++] = p[i];
	}
//	for (int i = 0; i < sz; ++i) fprintf(stderr, "%d ", st[i].id); fprintf(stderr, "\n");
	int cool = 0;
	for (int i = 1; i < sz; ++i) {
		if (st[i].cooler_than(st[cool])) {
			cool = i;
		}
	}
	for (int i = 0; i <= cool; ++i) {
		ans[i] = st[i].id;
	} 
	std::sort(ans, ans + cool + 1);
	for (int i = 0; i <= cool; ++i) {
		printf("%d ", ans[i] + 1);
	}
	puts("");
}
