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 

// package assignment;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class CF535E1
{
	static Point origin;

	static int cross(Point p1, Point p2, Point p3)
	{
		long cp = ((long) p3.x * (long) (p1.x - p2.x) * (long) p2.y * (long) (p1.y - p3.y) - (long) p2.x * (long) (p1.x - p3.x) * (long) p3.y * (long) (p1.y - p2.y));
		return (int) cp;
	}

	static class Point implements Comparable<Point>
	{
		int x, y, idx;
		boolean isOnHull;

		public Point(int x, int y, int idx)
		{
			this.x = x;
			this.y = y;
			this.idx = idx;
			this.isOnHull = false;
		}

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

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

		@Override
		public boolean equals(Object obj)
		{
			Point other = (Point) obj;
			if (this.x == other.x && this.y == other.y)
				return true;
			else
				return false;
		}

		public static Comparator<Point> pointComparator = new Comparator<CF535E1.Point>()
		{
			@Override
			public int compare(Point o1, Point o2)
			{
				if (o2.x == o1.x)
					return (o2.y - o1.y);
				else
					return (o2.x - o1.x);
			}
		};

		public static Comparator<Point> idxComparator = new Comparator<CF535E1.Point>()
		{
			@Override
			public int compare(Point o1, Point o2)
			{
				return (o1.idx - o2.idx);
			}
		};

	}

	public static void main(String[] args) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		Point[] pp = new Point[n];
		for (int i = 0; i < n; i++)
		{
			StringTokenizer st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());
			int y = Integer.parseInt(st.nextToken());
			pp[i] = new Point(x, y, (i + 1));
		}
		Arrays.sort(pp, Point.pointComparator);
		Point[] qq = new Point[n];
		qq[0] = pp[0];
		int qqsize = 1;
		for (int i = 1; i < n; i++)
		{
			if (pp[i].x < qq[qqsize - 1].x && pp[i].y > qq[qqsize - 1].y)
				qq[qqsize++] = pp[i];
		}
		//System.out.println("qqsize: " + qqsize + "\tn: " + n);
		int size = 0;
		Point[] hullPoints = new Point[qqsize];
//		hullPoints[0] = qq[0];
//		hullPoints[1] = qq[1];
		for (int i = 0; i < qqsize; i++)
		{
			while (size >= 2 && cross(hullPoints[size - 2], hullPoints[size - 1], qq[i]) < 0)
			{
				size--;
			}
			hullPoints[size] = qq[i];
			size = size + 1;
		}
		for(int i = 0; i < size; i++)
			hullPoints[i].isOnHull = true;
		//System.out.println("qqsize: " + qqsize + "\tn: " + n + "\tsize: " + size);
//		qq = new Point[size];
		//System.arraycopy(hullPoints, 0, qq, 0, size);
		// qq = Arrays.copyOfRange(hullPoints, 0, size);
//		qq[0] = hullPoints[0];
//		for (int i = 1; i < qq.length; i++)
//		{
//			if (qq[i - 1].isOnHull && qq[i - 1].equals(qq[i]))
//				qq[i].isOnHull = true;
//		}
		//System.out.println("Hull Points: " + Arrays.toString(hullPoints));
		//System.out.println("qq: " + Arrays.toString(qq));
//		Arrays.sort(qq, Point.idxComparator);
//		for (Point p : qq)
//		{
//			if (p.isOnHull)
//				System.out.print(p.idx + " ");
//		}
		for (int i = 1; i < pp.length; i++)
		{
			if (pp[i - 1].isOnHull && pp[i - 1].equals(pp[i]))
				pp[i].isOnHull = true;
		}
		Arrays.sort(pp, Point.idxComparator);
		for (Point p : pp)
		{
			if (p.isOnHull)
				System.out.print(p.idx + " ");
		}
	}
}
