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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;


public class pashmaks {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		Punto[] puntos = new Punto[t];
		for(int i = 0;i<t;i++){
			String[] input = br.readLine().split(" ");
			int s=Integer.parseInt(input[0]);
			int r=Integer.parseInt(input[1]);
			puntos[i]=new Punto(i+1,1.0/s,1.0/r);
		}
		Punto[] hull = convexHull(puntos);
		Punto L = hull[0];
		Punto B = hull[0];
		ArrayList<Integer> ans = new ArrayList<Integer>();
		double ymin = Double.MAX_VALUE;
		double xmin = Double.MAX_VALUE;
		for(int i=0;i<hull.length;i++){
			Punto p = hull[i];
			if(p.x<xmin){
				xmin = p.x;
				L = p;
			}
			if(p.y<ymin){
				ymin=p.y;
				B = p;
			}
			if(p.x==xmin && p.y<L.y) L=p;
			if(p.y==ymin && p.x<B.x) B=p;
		}
		boolean agregar = false;
		for(int i=0;i<hull.length;i++){
			Punto P = hull[i];
			if(P.id==L.id) agregar = true;
			if(agregar) ans.add(P.id);
			if(P.id==B.id) agregar = false;
		}
		Collections.sort(ans);
		StringBuilder sb = new StringBuilder();
		for(int id:ans) sb.append(id+" ");
		sb.deleteCharAt(sb.length()-1);
		System.out.println(sb.toString());
	}
	public static double cross(Punto O, Punto A, Punto B) {
		return (A.x - O.x) * (B.y - O.y) - (A.y - O.y) * (B.x - O.x);
	}
	
	public static Punto[] convexHull(Punto[] P) {

		if (P.length > 1) {
			int n = P.length, k = 0;
			Punto[] H = new Punto[2 * n];

			Arrays.sort(P);

			// Build lower hull
			for (int i = 0; i < n; ++i) {
				while (k >= 2 && cross(H[k - 2], H[k - 1], P[i]) <= 0)
					k--;
				H[k++] = P[i];
			}

			// Build upper hull
			for (int i = n - 2, t = k + 1; i >= 0; i--) {
				while (k >= t && cross(H[k - 2], H[k - 1], P[i]) <= 0)
					k--;
				H[k++] = P[i];
			}
			if (k > 1) {
				H = Arrays.copyOfRange(H, 0, k - 1); // remove non-hull vertices after k; remove k - 1 which is a duplicate
			}
			return H;
		} else if (P.length <= 1) {
			return P;
		} else{
			return null;
		}
	}
}
class Punto implements Comparable<Punto>{
	double x;
	double y;
	int id;
	Punto(int id,double x, double y){
		this.id=id;
		this.x=x;
		this.y=y;
	}
	@Override
	public String toString() {
		return "("+x+","+y+")";
	}
	@Override
	public int compareTo(Punto arg0) {
		int res = Double.compare(this.x,arg0.x);
		if (res==0) return Double.compare(this.y, arg0.y);
		return res;
		
	}
	public double distancePoint(Punto p1){
		return Math.sqrt((this.x-p1.x)*(this.x-p1.x)+(this.y-p1.y)*(this.y-p1.y));
	}
	public double distanceToLine(Punto p1, Punto p2){
		return Math.abs(pashmaks.cross(p1,this,p2)/(p2.distancePoint(p1)));
	}
}