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.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;

public class Code_Forces_535_E_Submit 
{

		static class Point implements Comparable<Point>{
		int x, y, id;
		boolean min, hull;

		Point(int s1, int r1, int id1)
		{
			this.x = s1;
			this.y = r1;
			this.id = id1;
			min = false;
			hull = false;
		}

		boolean equals(Point p)
		{
			return x == p.x && y == p.y;
		}

		@Override public int compareTo(Point p)
		{
			return cross(origin, this, p);
		}

		static Comparator<Point> xyCompare = new Comparator<Point>() 
		{
			public int compare(Point a, Point b) 
			{
				return b.x != a.x ? b.x - a.x : b.y - a.y;
			}
		};

		public static Comparator<Point> idCompare = new Comparator<Point>()
		{
			public int compare(Point p, Point q)
			{
				return p.id - q.id;
			}
		};

		public String toString()
		{
			return id + " -> " + x + " " + y;
		}
	}

	static Point origin = new Point(0,0,0);

	static long partOfHull(Point a, Point b, Point c)
	{
		return (long)(c.x * (a.x - b.x)) * (b.y * (a.y - c.y))
				- (long)(b.x * (a.x - c.x)) * (c.y * (a.y - b.y));
	}

	static int cross(Point a, Point b, Point c)
	{
		return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
	}

	static void printArray(Point[] arr, int n, PrintWriter pw)
	{
		for(int i = 0; i < n; i++)
			pw.println(arr[i].toString());
		pw.println();
	}

	static void printResultArray(Point[] arr, int n, PrintWriter pw) 
	{
		for(int i = 0; i < n; i++){
			if(arr[i].hull) 
				pw.print(arr[i].id + " ");
		}
	}

	public static void main (String[] args) throws java.lang.Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);

		int n = Integer.parseInt(br.readLine());
		Point[] PointArray = new Point[n];
	
		for(int i = 0; i < n; i++) 
		{
			String[] line = br.readLine().split(" ");
			PointArray[i] = new Point(Integer.parseInt(line[0]),Integer.parseInt(line[1]),i+1);
		}
		
		Arrays.sort(PointArray, Point.xyCompare);

		PointArray[0].min = true;
		for (int i = 0, j = 1; j < n; j++) 
		{
			if (PointArray[j].x < PointArray[i].x && PointArray[j].y > PointArray[i].y)
			{
				PointArray[j].min = true;
				i = j;
			}
		}

		Point[] hull = new Point[n];
		int size = 0;
		for(int i = 0; i < n; i++)
		{
			Point p = PointArray[i];
			if(!p.min) continue;
			while(true)
			{
				if(size < 2) break; 

				Point a = hull[size - 2];
				Point b = hull[size - 1];
				if(partOfHull(a,b,p) >= 0)
					break;
				size--;
			}
			hull[size++] = p;
		}
		for(int i = 0; i < size; i++)
		{
			hull[i].hull = true;
		}

		for(int i = 1; i < n; i++)
		{
			if(PointArray[i-1].hull && PointArray[i-1].equals(PointArray[i])) PointArray[i].hull = true;
		}
			
		Arrays.sort(PointArray, Point.idCompare);
		printResultArray(PointArray,n,pw);
		pw.close();
	}
}