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 

//535E

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.StringTokenizer;

public class TavasAndPashmaks {

	private final static BufferedReader br = new BufferedReader(
			new InputStreamReader(System.in));
	private final static PrintWriter pw = new PrintWriter(System.out);

	public static int[] r;
	public static int[] s;

	public static Comparator<Integer> compareByDescendingR = new Comparator<Integer>() {
		public int compare(Integer o1, Integer o2) {
			return r[o2] - r[o1];
		}
	};

	public static Comparator<Integer> compareByDescendingS = new Comparator<Integer>() {
		public int compare(Integer o1, Integer o2) {
			return s[o2] - s[o1];
		}
	};

	public static void main(String[] args) throws IOException {
		int n = Integer.parseInt(br.readLine());

		s = new int[n];
		r = new int[n];

		Integer[] p = new Integer[n];

		for (int i = 0; i < n; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			s[i] = Integer.parseInt(st.nextToken());
			r[i] = Integer.parseInt(st.nextToken());
			p[i] = i;
		}

		Arrays.sort(p, compareByDescendingS);
		Arrays.sort(p, compareByDescendingR);

		Deque<Integer> st = new ArrayDeque<Integer>();

		st.push(0);
		for (int i = 1; i < p.length; i++) {
			// We handle equal values later
			if (r[p[i]] < r[p[st.peek()]]) {
				if (s[p[i]] > s[p[st.peek()]]) {
					int prv = st.pop();
					while (!st.isEmpty() && covers(p[i], p[prv], p[st.peek()])) {
						prv = st.pop();
					}
					st.push(prv);
					st.push(i);
				}
			}
		}
		
		// Add repeated runner values here
		for (Integer i : st) {
			int j = 1;
			while (i+j < n && r[p[i]] == r[p[i+j]] && s[p[i]] == s[p[i+j]]) {
				st.push(i+(j++));
			}
		}
		
		// Print output
		Integer[] res = new Integer[st.size()];
		st.toArray(res);
		for (int i = 0; i < res.length; i++) {
			res[i] = p[res[i]]+1; 
		}
		Arrays.sort(res);
		pw.println(Arrays.toString(res).replaceAll("[\\]\\[,]", ""));
		pw.close();
	}

	private static boolean covers(int newS, int oldS, int preS) {
		long left = s[oldS] * r[preS] * (long) (s[newS] - s[preS] + r[oldS] - r[newS]);
		long rght = s[preS] * r[oldS] * (long) (s[newS] - s[oldS] + r[preS] - r[newS]);
		return left < rght;
	}
}
