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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Comparator;

@SuppressWarnings("javadoc")
public class TavasAndPashmaks {

	public TavasAndPashmaks() throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(
				System.out));

		int n = Integer.parseInt(br.readLine());

		String[] split;
		int[][] array = new int[n][];

		for (int i = 0; i < n; i++) {
			split = br.readLine().split(" ");
			array[i] = new int[4];
			array[i][0] = Integer.parseInt(split[0]);
			array[i][1] = Integer.parseInt(split[1]);
			array[i][2] = i + 1;
		}

		sortBy(array, 1, 0);

		int maxr = -1;
		int counter = 0;

		for (int i = 0; i < n; i++) {
			if (array[i][0] > maxr) {
				counter++;
				for (int j = i; j < n; j++) {
					if (array[j][1] == array[i][1]
							&& array[j][0] == array[i][0]) {
						array[j][3] = 1;
					} else {
						maxr = array[i][0];
						i = j - 1;
						break;
					}
				}
			}
		}

		sortBy(array, 3, 1);

		int[][] candidates = new int[counter][4];
		candidates[0] = array[0].clone();
		for (int i = 1, j = 1; i < array.length; i++) {
			if (array[i][3] == 0)
				break;
			if (array[i][0] != array[i-1][0])
				candidates[j++] = array[i].clone();
		}

		double prev, next = ((double)candidates[1][0])*candidates[0][0]*(candidates[1][1]-candidates[0][1]);
		next /= ((double)candidates[1][1])*candidates[0][1]*(candidates[0][0]-candidates[1][0]);

		for (int i = 1; i < candidates.length-1; i++) {
			prev = next;
			next = ((double)candidates[i+1][0])*candidates[i][0]*(candidates[i+1][1]-candidates[i][1]);
			next /= ((double)candidates[i+1][1])*candidates[i][1]*(candidates[i][0]-candidates[i+1][0]);
			if (prev > next) {
				candidates[i][3] = 0;
			}
		}

		for (int i = 0, j = 0; i < array.length && j < candidates.length;j++) {
			if (candidates[j][3] == 0) {
				while (array[i][0] != candidates[j][0]) {
					i++;
				}
				while (i < array.length && array[i][0] == candidates[j][0]) {
					array[i][3] = 0;
					i++;
				}
			}
		}

		sortBy(array, 3, 2);

		for (int i = n - 1; i >= 0; i--) {
			if (array[i][3] == 1) {
				bw.write(array[i][2] + " ");
			}
		}

		br.close();
		bw.close();
	}

	public static void main(String[] args) throws IOException {
		new TavasAndPashmaks();

	}

	// Orden descendente
	void sortBy(int matrix[][], final int primary, final int secondary) {
		Comparator<int[]> comparator = new Comparator<int[]>() {
			@Override
			public int compare(int[] o1, int[] o2) {
				if (o1[primary] == o2[primary]) {
					if (o1[secondary] == o2[secondary])
						return 0;
					else if (o1[secondary] < o2[secondary])
						return 1;
					else
						return -1;
				} else if (o1[primary] < o2[primary])
					return 1;
				else
					return -1;
			}
		};

		Arrays.sort(matrix, comparator);
	}
}
