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 

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	private final int MAX = 10001;

	public void solve() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		P[] ps = new P[N];
		int[] s = new int[N];
		int[] r = new int[N];
		int[] maxr = new int[MAX];
		for (int i = 0; i < ps.length; i++) {
			s[i] = sc.nextInt();
			r[i] = sc.nextInt();
			ps[i] = new P(1.0 / s[i], 1.0 / r[i]);
			maxr[s[i]] = Math.max(maxr[s[i]], r[i]);
		}

		ArrayList<Integer>[] maxrIDs = new ArrayList[MAX];
		for (int i = 0; i < MAX; i++) {
			maxrIDs[i] = new ArrayList<>();
		}

		for (int i = 0; i < N; i++) {
			if (r[i] == maxr[s[i]]) {
				maxrIDs[s[i]].add(i + 1);
			}
		}

		P[] qs = convexHull(ps);
		Arrays.sort(qs);
		ArrayList<Integer> ans = new ArrayList<>();
		int y = -1;
		for (int i = MAX - 1; i >= 0; i--) {
			if (maxrIDs[i].size() == 0) {
				continue;
			}
			if (y != -1 && maxr[y] >= maxr[i]) {
				continue;
			}
			P p = new P(1.0 / i, 1.0 / maxr[i]);
			if (Arrays.binarySearch(qs, p) >= 0) {
				for (Integer e : maxrIDs[i]) {
					ans.add(e);
				}
			}
			y = i;
		}
		Collections.sort(ans);
		for (Integer integer : ans) {
			System.out.print(integer + " ");
		}
		System.out.println();
	}

	private P[] convexHull(P[] ps) {
		double EPS = 1e-30;
		int n = ps.length;
		int k = 0;
		Arrays.sort(ps);
		P[] qs = new P[n * 2];
		for (int i = 0; i < n; i++) {
			while (k > 1 && (qs[k - 1].sub(qs[k - 2])).det(ps[i].sub(qs[k - 1])) < EPS) {
				k--;
			}
			qs[k] = ps[i];
			k++;
		}

		P[] res = new P[k];
		System.arraycopy(qs, 0, res, 0, k);
		return res;
		// int t = k;
		// for (int i = n - 2; i >= 0; i--) {
		// while (k > t && (qs[k - 1].sub(qs[k - 2])).det(ps[i].sub(qs[k - 1]))
		// < EPS) {
		// k--;
		// }
		// qs[k] = ps[i];
		// k++;
		// }
		// P[] res = new P[k - 1];
		// System.arraycopy(qs, 0, res, 0, k - 1);
		// return res;
	}

	public static void main(String[] args) {
		new Main().solve();
	}

}

// 2次元座標
class P implements Comparable<P> {
	double x, y;

	public P(double x, double y) {
		this.x = x;
		this.y = y;
	}

	P add(P p) {
		return new P(x + p.x, y + p.y);
	}

	P sub(P p) {
		return new P(x - p.x, y - p.y);
	}

	P mul(double m) {
		return new P(x * m, y * m);
	}

	P div(double d) {
		return new P(x / d, y / d);
	}

	double abs() {
		return Math.sqrt(abs2());
	}

	double abs2() {
		return x * x + y * y;
	}

	double arg() {
		return Math.atan2(y, x);
	}

	double dot(P p) {
		return x * p.x + y * p.y;
	}

	double det(P p) {
		return x * p.y - y * p.x;
	}

	double ang(P p) {
		return Math.atan2(det(p), dot(p));
	}

	P rot90() {
		return new P(y, -x);
	}

	P rot(double d) {
		return new P(Math.cos(d) * x - Math.sin(d) * y, Math.sin(d) * x + Math.cos(d) * y);
	}

	public int compareTo(P p) {
		return Double.compare(x, p.x) * 2 + Double.compare(y, p.y);
	}
}