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

public class C {

	final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok = new StringTokenizer("");

	class Player implements Comparable<Player> {
		long s;
		long r;
		int index;

		public Player(int s, int r, int index) {
			this.s = s;
			this.r = r;
			this.index = index;
		}

		@Override
		public int compareTo(Player other) {
			if (this.s > other.s) return -1;
			if (this.s < other.s) return 1;
			if (this.r > other.r) return -1;
			if (this.r < other.r) return 1;
			return 0;
		}
	}

	static class Drobe {
		long up;
		long down;

		public Drobe(long up, long down) {
			this.up = up;
			this.down = down;
			long gcd = gcd(up, down);
			this.up /= gcd;
			this.down /= gcd;
		}

		long gcd(long x, long y) {
			if (x == 0) return y;
			if (y == 0) return x;
			return gcd(y, x % y);
		}

		static boolean can(Drobe lessThan, Drobe moreThan) {
			BigInteger first = BigInteger.valueOf(lessThan.up);
			first = first.multiply(BigInteger.valueOf(moreThan.down));
			BigInteger second = BigInteger.valueOf(moreThan.up);
			second = second.multiply(BigInteger.valueOf(lessThan.down));
			if(first.compareTo(second) >= 0) return true;
			return false;
		}
	}

	void solve() throws IOException {
		int n = readInt();
		Player[] players = new Player[n];
		for (int i = 0; i < n; i++) {
			players[i] = new Player(readInt(), readInt(), i + 1);
		}
		Arrays.sort(players);
		boolean[] can = new boolean[n];
		can[0] = true;
		long max = players[0].r;
		List<Player> potWins = new ArrayList<Player>();
		for (int i = 1; i < n; i++) {
			if (players[i].compareTo(players[i - 1]) == 0) {
				can[i] = can[i - 1];
			}
			if (players[i].r > max) {
				max = players[i].r;
				can[i] = true;
			}
		}
		for (int i = 0; i < n; i++) {
			if (can[i]) {
				potWins.add(players[i]);
			}
		}

		Drobe[] sr = new Drobe[potWins.size()]; // s div r less or equal then
		for (int i = 1; i < potWins.size(); i++) {
			Player cur = potWins.get(i);
			Player prev = potWins.get(i - 1);
			if(cur.compareTo(prev) == 0) {
				sr[i] = sr[i-1];
				continue;
			}
			long up = (cur.r - prev.r) * (cur.s * prev.s);
			long down = (cur.r * prev.r) * (prev.s - cur.s);
			sr[i] = new Drobe(up, down);
		}

		boolean[] win = new boolean[potWins.size()];
		win[0] = true;
		win[potWins.size() - 1] = true;

		Drobe maxDrobe = new Drobe(0, 1);

		for (int i = potWins.size() - 2; i >= 1; i--) {
			Player cur = potWins.get(i);
			Player prev = potWins.get(i+1);
			if(cur.compareTo(prev) == 0) {
				win[i] = win[i+1];
				continue;
			}
			long up = (prev.r - cur.r) * (cur.s * prev.s);
			long down = (cur.r * prev.r) * (cur.s - prev.s);
			Drobe moreThan = new Drobe(up, down);

			if(Drobe.can(sr[i], moreThan)) {
				win[i] = true;
			}
		}
		List<Integer> nums = new ArrayList<Integer>();
		for(int i = 0; i < potWins.size(); i++) {
			if(win[i]) {
				nums.add(potWins.get(i).index);
			}
		}
		Collections.sort(nums);
		for(int i: nums) {
			out.print(i + " ");
		}
	}


	void init() throws FileNotFoundException {
		if (ONLINE_JUDGE) {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
		} else {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter("output.txt");
		}
	}

	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	long readLong() throws IOException {
		return Long.parseLong(readString());
	}

	double readDouble() throws IOException {
		return Double.parseDouble(readString());
	}

	int[] readArr(int n) throws IOException {
		int[] res = new int[n];
		for (int i = 0; i < n; i++) {
			res[i] = readInt();
		}
		return res;
	}

	long[] readArrL(int n) throws IOException {
		long[] res = new long[n];
		for (int i = 0; i < n; i++) {
			res[i] = readLong();
		}
		return res;
	}

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

	public void run() {
		try {
			long t1 = System.currentTimeMillis();
			init();
			solve();
			out.close();
			long t2 = System.currentTimeMillis();
			System.err.println("Time = " + (t2 - t1));
		} catch (Exception e) {
			e.printStackTrace(System.err);
			System.exit(-1);
		}
	}
}