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 

#include <stdio.h>
#include <vector>
#include <algorithm>

struct frac{ // ring structure
	int p;
	int q;
};
frac operator+(frac A ,frac B)
{
	frac C;
	C.p = A.p*B.q + A.q*B.p;
	C.q = A.q*B.q;
	return C;
}
frac operator*(frac A, frac B)
{
	frac C;
	C.p = A.p*B.p;
	C.q = A.q*B.q;
	return C;
}
bool operator<(frac A, frac B)
{
	int S = A.p*B.q;
	int T = A.q*B.p;
	return S<T;
}
bool operator==(frac A, frac B)
{
	int S = A.p*B.q;
	int T = A.q*B.p;
	return S==T;
}
struct str{
	frac first;
	frac second;
	int index;
}x[200010];
bool cmp(str a, str b)
{
	if(a.first==b.first) return a.second<b.second;
	return a.first<b.first;
}
std::vector<str> P,St;
 
int CCW(str A, str B, str C)
{
	/*
	printf("%lf %lf!\n",A.first,A.second);
	printf("%lf %lf!!\n",B.first,B.second);
	printf("%lf %lf!!!\n",C.first,C.second);
	*/
	frac s1 = A.first*B.second + B.first * C.second + C.first * A.second;
	frac s2 = A.second*B.first + B.second * C.first + C.second * A.first;
	if(s2<s1) return 1;
	if(s1==s2) return 0;
	if(s1<s2) return -1;
}
 
int check[200010];
int main()
{
	int a;
	scanf("%d",&a);
	
	for(int i=1;i<=a;i++)
	{
		double b,c;
		scanf("%lf%lf",&b,&c);
		x[i]={{1,b},{1,c},i};
	}
	std::sort(x+1,x+a+1,cmp);
	frac max = x[1].second;
	P.push_back(x[1]);
	for(int i=2;i<=a;i++)
	{
		if(x[i].second<max)
		{
			P.push_back(x[i]);
			max = x[i].second;
		}
	}
	if(P.size()<=1)
	{
		printf("%d",P[0].index);
		return 0;
	}
	else
	{
		St.push_back(P[0]);
		St.push_back(P[1]);
		for(int i=2;i<P.size();i++)
		{
			while(St.size()>=2)
			{
				str A = St[St.size()-1];
				str B = St[St.size()-2];
				if(CCW(B,A,P[i])<0) St.pop_back();
				else break;
			}
			St.push_back(P[i]);
		}
		for(int i=0;i<St.size();i++) check[St[i].index] = 1;
		for(int i=1;i<=a;i++) if(check[i]==1) printf("%d ",i);
	}
}
