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.util.*;
import java.io.*;
public class Ishani {
public static void main(String [] args){
	Scanner in=new Scanner(System.in);
	int n=in.nextInt();
	double eps=1E-9;
	Ppoint array[]=new Ppoint[n];
	for(int i=0;i<n;i++)array[i]=new Ppoint(in.nextLong(),in.nextLong());
	point first[]=new point[n];
	point second[]=new point[n];
	point mixed[]=new point[n];
	double fix=100000000000000D;
	double anfix=10000D;
	for(int i=0;i<n;i++){
	first[i]=new point(fix/array[i].x + anfix/array[i].y,i+1);
	second[i]=new point(fix/array[i].y + anfix/array[i].x,i+1);
	mixed[i]=new point(fix/array[i].x + fix/array[i].y,i+1) ;
}
 Arrays.sort(first,new Sorter());
 Arrays.sort(second,new Sorter());
 Arrays.sort(mixed,new Sorter());
 TreeSet<Long>ans=new TreeSet<Long>();
 double last=first[0].x;ans.add(first[0].y);
 for(int i=1;i<n;i++){
 	if(first[i].x <= last+eps && last-eps <= first[i].x)ans.add(first[i].y);
 	else break;
 }
 //System.out.println(ans);
 last=second[0].x;ans.add(second[0].y);
 for(int i=1;i<n;i++){
 	if(second[i].x <= last+eps && last-eps <= second[i].x)ans.add(second[i].y);
 	else break;
 }
 //System.out.println(ans);
 last=mixed[0].x;ans.add(mixed[0].y);
 for(int i=1;i<n;i++){
 	if(mixed[i].x <= last+eps && last-eps <= mixed[i].y)ans.add(mixed[i].y);
 else break;
}
for(Long a: ans)System.out.print(a+" ");
}
static class point{
	double x;
	long y;
	public point(double a,long b){
	x=a;
	y=b;
	}
}
static class Ppoint{
	long x;
	long y;
	public Ppoint(long a,long b){
	x=a;y=b;
	}
}
static class Sorter implements Comparator<point>{
	public int compare(point a,point b){
	if(a.x > b.x)return 1;
	if(a.x==b.x)return 0;
	else return -1;
	}
}
}