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;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class CF535E
{
	public static void main(String[] args) throws NumberFormatException, IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		Point[] pp = new Point[n];
		TreeMap<Point, ArrayList<Integer>> map = new TreeMap<Point, ArrayList<Integer>>();
		for (int i = 0; i < n; i++)
		{
			StringTokenizer st = new StringTokenizer(br.readLine());
			int s = Integer.parseInt(st.nextToken());
			int r = Integer.parseInt(st.nextToken());
			pp[i] = new Point(1.0d / s, 1.0d / r, (i + 1));
			if (!map.containsKey(pp[i]))
			{
				ArrayList<Integer> list = new ArrayList<Integer>();
				list.add(i + 1);
				map.put(pp[i], list);
			}
			else
				map.get(pp[i]).add(i + 1);
		}
		Point[] hull = convexHull(pp);
		// L be the leftmost point on this convex hull (if there are more than one, choose the one with minimum y component).
		Point L = hull[0];
		// D be the point with minimum y component on this convex hull (if there are more than one, consider the leftmost).
		Point D = hull[0];
		ArrayList<Integer> winners = new ArrayList<Integer>();
		double ymin = Double.MAX_VALUE;
		double xmin = Double.MAX_VALUE;
		for (int i = 0; i < hull.length; i++)
		{
			Point p = hull[i];
			if (p.x < xmin)
			{
				xmin = p.x;
				L = p;
			}
			if (p.y < ymin)
			{
				ymin = p.y;
				D = p;
			}
			if (p.x == xmin && p.y < L.y)
				L = p;
			if (p.y == ymin && p.x < D.x)
				D = p;
		}
		// Adding points from L to D to the answer
		boolean flag = false;
		for (Point p : hull)
		{
			if (p.idx == L.idx)
				flag = true;
			if (flag)
				winners.addAll(map.get(p));
			if (p.idx == D.idx)
				flag = false;
		}
		Collections.sort(winners);
		for (int i : winners)
			System.out.print(i + " ");
	}

	public static double cross(Point p1, Point p2, Point p3)
	{
		return (p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x);
	}

	public static Point[] convexHull(Point[] pp)
	{
		if (pp.length <= 1)
			return pp;
		else if (pp.length > 1)
		{
			int n = pp.length, k = 0;
			Point[] hull = new Point[2 * n];
			Arrays.sort(pp);
			for (int i = 0; i < n; ++i)
			{
				while (k >= 2 && cross(hull[k - 2], hull[k - 1], pp[i]) <= 0)
					k--;
				hull[k++] = pp[i];
			}
			for (int i = n - 2, t = k + 1; i >= 0; i--)
			{
				while (k >= t && cross(hull[k - 2], hull[k - 1], pp[i]) <= 0)
					k--;
				hull[k++] = pp[i];
			}
			if (k > 1)
				hull = Arrays.copyOfRange(hull, 0, k - 1);
			return hull;
		}
		else
			return null;
	}

	static class Point implements Comparable<Point>
	{
		double x;
		double y;
		int idx;

		Point(double x, double y, int id)
		{
			this.x = x;
			this.y = y;
			this.idx = id;
		}

		@Override
		public String toString()
		{
			return "(" + x + "," + y + ")";
		}

		@Override
		public int compareTo(Point arg0)
		{
			int res = Double.compare(this.x, arg0.x);
			if (res == 0)
				return Double.compare(this.y, arg0.y);
			return res;

		}

		public double distancePoint(Point p1)
		{
			return Math.sqrt((this.x - p1.x) * (this.x - p1.x) + (this.y - p1.y) * (this.y - p1.y));
		}

		public double distanceToLine(Point p1, Point p2)
		{
			return Math.abs(CF535E.cross(p1, this, p2) / (p2.distancePoint(p1)));
		}
	}
}