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 C {

	BufferedReader br;
	PrintWriter out;
	StringTokenizer st;
	boolean eof;

	static class Man implements Comparable<Man> {
		long x, y;
		int id;

		public Man(long x, long y, int id) {
			this.x = x;
			this.y = y;
			this.id = id;
		}

		@Override
		public int compareTo(Man o) {
			if (x != o.x) {
				return x < o.x ? 1 : -1;
			}
			return Long.compare(y, o.y);
		}
	}

	boolean bad(Man a, Man b, Man c) {
		long val = a.x * b.x * c.y * (b.y - a.y) + c.x * a.x * b.y
				* (a.y - c.y) + b.x * c.x * a.y * (c.y - b.y);
		return val < 0;
	}

	void solve() throws IOException {
		int n = nextInt();
		Man[] a = new Man[n];
		for (int i = 0; i < n; i++) {
			a[i] = new Man(nextInt(), nextInt(), i);
		}
		int[] repr = new int[n];
		Arrays.fill(repr, -1);
		Arrays.sort(a);
		Man[] hull = new Man[n];
		int sz = 1;
		hull[0] = a[0];
		for (int i = 1; i < n; i++) {
			if (a[i].x == a[i - 1].x && a[i].y == a[i - 1].y) {
				repr[a[i].id] = a[i - 1].id;
				continue;
			}
			while (sz > 1 && bad(hull[sz - 2], hull[sz - 1], a[i])) {
				sz--;
			}
			hull[sz++] = a[i];
		}
		
		while (sz > 1 && hull[sz - 1].x <= hull[sz - 2].x && hull[sz - 1].y <= hull[sz - 2].y) {
			sz--;
		}
		
		long bestX = -1;
		for (int i = 0; i < n; i++) {
			bestX = Math.max(bestX, a[i].x);
		}
		long bestXbestY = -1;
		for (int i = 0; i < n; i++) {
			if (a[i].x == bestX) {
				bestXbestY = Math.max(bestXbestY, a[i].y);
			}
		}
		
		long bestY = -1;
		for (int i = 0; i < n; i++) {
			bestY = Math.max(bestY, a[i].y);
		}
		long bestYbestX = -1;
		for (int i = 0; i < n; i++) {
			if (a[i].y == bestY) {
				bestYbestX = Math.max(bestYbestX, a[i].x);
			}
		}
		
		
		
		boolean[] good = new boolean[n];
		for (int i = 0; i < sz; i++) {
			if (hull[i].x == bestX && hull[i].y < bestXbestY) {
				continue;
			}
			if (hull[i].y == bestY && hull[i].x < bestYbestX) {
				continue;
			}
			good[hull[i].id] = true;
		}
		for (int i = 0; i < n; i++) {
			if (repr[i] != -1) {
				good[i] = good[repr[i]];
			}
		}
		
		for (int i = 0; i < n; i++) {
			if (good[i]) {
				out.print((i + 1) + " ");
			}
		}
		
		out.println();
	}

	C() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		solve();
		out.close();
	}

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

	String nextToken() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				eof = true;
				return null;
			}
		}
		return st.nextToken();
	}

	String nextString() {
		try {
			return br.readLine();
		} catch (IOException e) {
			eof = true;
			return null;
		}
	}

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

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

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