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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#define int64 long long

using namespace std;
struct point{
	double x,y;   int whe;
}a[200100],s[200100];
typedef point Vector;
const double eps = 1e-8;
int n,top;
int head[200100],next[500100],to[500100],top2;
bool vis[200100],viss[200100];

double across(Vector x,Vector y)
{
	return x.x * y.y - x.y * y.x;
}
int dcmp(double x)
{
	if (fabs(x) < eps)    return 0;
	else if (x > eps)   return 1;
	else return -1;
}

void link(int x,int y)
{
	next[++top2] = head[x];   head[x] = top2;  to[top2] = y;
}
Vector operator - (point x,point y){return (point){x.x - y.x,x.y - y.y,0};}
bool operator == (point x,point y){return dcmp(x.x - y.x) == 0 && dcmp(x.y - y.y) == 0;}
double dis(point x){return x.x * x.x + x.y * x.y;}
bool cmp(point x,point y)
{
	if (dcmp(across(x - y,x - a[1])) == 0)   return dis(x - a[1]) < dis(y - a[1]);
	else return dcmp(across(x - y,x - a[1])) > 0;
}
bool cmp1(point x,point y){return x.x < y.x || (x.x == y.x && x.y < y.y);}
bool cmp2(point x,point y){return viss[x.whe] < viss[y.whe];}
void work()
{
	int whe = 1;
	for (int i = 2;i <= n;i++)
		if (a[i].x < a[whe].x || (a[i].x == a[whe].x && a[i].y < a[whe].y))  whe = i;
	swap(a[whe],a[1]);
	sort(a + 2,a + n + 1,cmp);
	s[++top] = a[1];  s[++top] = a[2];
	for (int i = 3;i <= n;i++)
		{
			while (top >= 2 && dcmp(across(a[i] - s[top],a[i] - s[top - 1])) > 0)
				top--;
			s[++top] = a[i];
		}
	vis[s[1].whe] = 1;
	for (int i = 2;i <= top;i++)
		if (dcmp(s[i].y - s[i - 1].y) <= 0)  {
			vis[s[i].whe] = 1;
			for (int j = head[s[i].whe],y;y = to[j],j;j = next[j])  vis[y] = 1;
		}else break;
	for (int i = 1;i <= n;i++)
		if (vis[i])   printf("%d ",i);
}

int main()
{
	cin >> n;
	for (int i = 1;i <= n;i++)
		scanf("%lf %lf",&a[i].x,&a[i].y),a[i].x = 1 / a[i].x,a[i].y = 1 / a[i].y,a[i].whe = i;
	sort(a + 1,a + n + 1,cmp1);
	int size = n;
	for (int i = 1;i <= size;i++)
		if (a[i] == a[i - 1])   link(a[i - 1].whe,a[i].whe),viss[a[i].whe] = 1,swap(a[i],a[i - 1]),n--;
	sort(a + 1,a + size + 1,cmp2);  n = size;
	work();
}
  
