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.*;
import java.util.*;

public class taskC {

	void solve() throws IOException {
		int n = nextInt();
		int[] best = new int[10001];
		ArrayList<Integer>[] bestNum = new ArrayList[10001];

		for (int i = 0; i < n; i++) {
			int r = nextInt();
			int s = nextInt();
			if (s > best[r]) {
				best[r] = s;
				bestNum[r] = new ArrayList<Integer>();
			}
			if (s == best[r])
				bestNum[r].add(i + 1);
		}

		ArrayList<Integer> ans = new ArrayList<Integer>();
		for (int i = 1; i <= 10000; i++) {
			if (best[i] == 0)
				continue;
			boolean can = true;
			double maxRS = Double.MAX_VALUE;
			for (int j = i + 1; j <= 10000; j++) {
				if (best[j] == 0)
					continue;
				if (best[j] >= best[i]) {
					can = false;
					break;
				} else {
					maxRS = Math.min(maxRS, 1.0 * i * j / best[i] / best[j]
							* (best[i] - best[j]) / (j - i));
				}
			}
			if (!can)
				break;
			double minRS = 0;
			for (int j = 1; j < i; j++) {
				if (best[j] == 0)
					continue;
				if (best[i] <= best[j]) {
					minRS = Math.max(minRS, 1.0 * i * j / best[i] / best[j]
							* (best[i] - best[j]) / (j - i));
				}
			}

			
			if (maxRS >= minRS && can)
				ans.addAll(bestNum[i]);
		}

		// out.println(ans.size());
		Collections.sort(ans);
		for (int i = 0; i < ans.size(); i++) {
			out.print(i < ans.size() - 1 ? ans.get(i) + " " : ans.get(i));
		}
	}

	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;

	void run() {
		try {
			br = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			// br = new BufferedReader(new FileReader(new File("taskC.in")));
			// out = new PrintWriter("taskC.out");

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static void main(String[] args) {
		new taskC().run();
	}

	String nextToken() throws IOException {
		while ((st == null) || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	int nextInt() throws NumberFormatException, IOException {
		return Integer.parseInt(nextToken());
	}

	double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}

	long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(nextToken());
	}
}
