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;
using ll = long long;

struct Frac {
	ll a, b;
	Frac(ll _a = 0, ll _b = 1) : a(_a), b(_b) {
		if(b < 0) a *= -1, b *= -1;
		if(b == 0) a = 0, b = 1;
		// auto g = __gcd(a, b);
		// if(g) a /= g, b /= g;
	}
	Frac operator-(const Frac &o) const {
		return Frac(a * o.b - o.a * b, b * o.b);
	}
	Frac operator+(const Frac &o) const {
		return Frac(a * o.b - o.a * b, b * o.b);
	}
	Frac operator/(const Frac &o) const {
		return Frac(a * o.b, b * o.a);
	}
	Frac operator*(const Frac &o) const {
		return Frac(a * o.a, b * o.b);
	}
	bool operator<(const Frac &o) const {
		assert(b > 0); assert(o.b > 0);
		return a * o.b < o.a * b;
	}
	bool operator>(const Frac &o) const {
		return (o < *this);
	}
	bool operator<=(const Frac &o) const {
		return !(operator>(o));
	}
	bool operator==(const Frac &o) const {
		return a * o.b == b * o.a;
	}
	void fix() {
		auto g = __gcd(a, b);
		if(g) a /= g, b /= g;
		else a = 0, b = 1;
		if(b < 0) a *= -1, b *= -1;
	}
};

struct Line {
	Frac m, b;
	Line(Frac _m = Frac(), Frac _b = Frac()) : m(_m), b(_b) {}
	bool operator==(const Line &o) const {
		return m == o.m and b == o.b;
	}
};

pair<Frac, Frac> inter(const Line &a, const Line &b) {
	auto x = (a.b - b.b) / (b.m - a.m);
	auto y = (a.m * x) + a.b;
	x.fix(), y.fix();
	return make_pair(x, y);
}

vector<Line> cht;

void push_line(Line L) {
	if(!cht.empty() and cht.back().m == L.m) {
		if(cht.back().b <= L.b) return;
		cht.pop_back();
	}
	while((int)cht.size() >= 2) {
		const int sz = (int)cht.size();
		if(inter(L, cht[sz-1]).first <= inter(L, cht[sz-2]).first)
			cht.pop_back();
		else break;
	}
	if(!cht.empty()) {
		if(inter(L, cht.back()).first.a <= 0) cht.pop_back();
	}
	cht.push_back(L);
}

const int N = 200005;
int n;
Line v[N];
int id[N];

int main() {

	scanf("%d", &n);

	for(int i = 0; i < n; i++) {
		int s, r;
		scanf("%d %d", &s, &r);
		// swap(s, r);
		v[i] = Line(Frac(1, s), Frac(1, r));
		id[i] = i;
	}
	
	sort(id, id + n, [](int i, int j) {
		if(v[i].m == v[j].m) return v[i].b < v[j].b;
		return v[i].m > v[j].m;
	});

	for(int i = 0; i < n; i++) {
		// printf("%d\n", id[i]);
		push_line(v[ id[i] ]);
	}

	for(int i = 0; i < (int)cht.size(); i++) {
		// printf("> %lld/%lld %lld/%lld\n", cht[i].m.a, cht[i].m.b, cht[i].b.a, cht[i].b.b);
	}

	vector<int> ans;
	for(int i = 0, j = 0; i < n; i++) {
		// if(i and v[ id[i] ].m == v[ id[i - 1] ].m) continue;
		while(j < (int)cht.size() and cht[j].m > v[ id[i] ].m) j++;
		if(j == (int)cht.size()) break;
		if(cht[j] == v[ id[i] ]) {
			ans.push_back(id[i]);
			continue;
		}
		if(cht[j].m == v[ id[i] ].m) continue;
		if(j-1 >= 0) {
			if(cht[j-1].m == v[ id[i] ].m) continue;
			auto a = inter(cht[j], v[ id[i] ]);
			auto b = inter(cht[j-1], v[ id[i] ]);
			if(a == b) {
				ans.push_back(id[i]);
				continue;
			}
		}
		if(j+1 < (int)cht.size()) {
			if(cht[j+1].m == v[ id[i] ].m) continue;
			auto a = inter(cht[j], v[ id[i] ]);
			auto b = inter(cht[j+1], v[ id[i] ]);
			if(a == b) {
				ans.push_back(id[i]);
				continue;
			}
		}
	}

	if(n > 10) cout << cht.size() << " " << ans.size() << endl;

	sort(ans.begin(), ans.end());

	for(int x : ans) printf("%d ", x+1);

	printf("\n");
}
