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.StringTokenizer;

public class CF535E1
{
	static Point origin;

	static int cross(Point o, Point a, Point b)
	{
		// return (p2.y*p3.x*(p1.x - p2.x)*(p1.y - p3.y)) - (p2.x*p3.y*(p1.y-p2.y)*(p1.x-p3.y));
		return (a.y * b.x * o.x * o.y - a.y * o.x * b.x * b.y - o.y * b.x * a.x * a.y + a.x * b.x * a.y * b.y)
				- (a.x * b.y * o.x * o.y - a.x * o.y * b.x * b.y - o.x * b.y * a.x * a.y + a.x * b.x * a.y * b.y);
	}

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

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

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

		public double distance(Point q)
		{
			return (this.x - q.x) * (this.x - q.x) + (this.y - q.y) * (this.y - q.y);
		}

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

		@Override
		public int hashCode()
		{
			final int prime = 31;
			int result = 1;
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

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

	}

	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));
		}
		int j = 0;
		for (int i = 1; i < n; i++)
		{
			Point p = pp[j];
			Point q = pp[i];
			if (q.y < p.y)
				j = i;
		}
		Point t = pp[0];
		pp[0] = pp[j];
		pp[j] = t;
		origin = pp[0];
		Arrays.sort(pp, 1, n);

		Point[] hull = new Point[n];
		hull[0] = pp[0];
		hull[1] = pp[1];
		int size = 2;
		for (int i = 2; i < n; i++)
		{
			while (size >= 2 && cross(hull[size - 2], hull[size - 1], pp[i]) >= 0)
				size--;
			hull[size++] = pp[i];
		}
		// System.out.println("Hull:" + Arrays.toString(hull) + "size: " + size);
		/*
		 * 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];
		int l = 0;
		for (int i = 0; i < size; i++)
		{
			Point p = hull[i];
			if (p == null)
				break;
			if (p.x >= L.x)
			{
				if (p.x == L.x)
				{
					if (p.y > L.y)
					{
						L = p;
						l = i;
					}
				}
				else if (p.x > L.x)
				{
					L = p;
					l = i;
				}
			}

		}
		/*
		 * 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];
		int d = 0;
		for (int i = 0; i < size; i++)
		{
			Point p = hull[i];
			if (p == null)
				break;
			if (p.y >= D.y)
			{
				if (p.y == D.y)
				{
					if (p.x > D.x)
					{
						D = p;
						d = i;
					}
				}
				else if (p.y > D.y)
				{
					D = p;
					d = i;
				}
			}
		}
		// System.out.println("D: " + D + "\td: " + d);
		// System.out.println("L: " + L + "\tl: " + l);
		/*
		 * The answer is the points on the path from D(d) to L(l) on the convex hull (bottom-left arc)
		 */
		for (int i = d; i <= l; i++)
		{
			System.out.print(hull[i].idx + " ");
		}
		if (l < d)
			for (int i = 0; i < l; i++)
			{
				System.out.print(hull[i].idx + " ");
			}
		// boolean flag = false;
		// for(int i = 0; i < size; i++)
		// {
		// if(D == hull[i])
		// {
		// flag = true;
		// }
		// else if(L == hull[i])
		// {
		// System.out.println(hull[i].idx);
		// break;
		// }
		// if(flag)
		// {
		// System.out.println(hull[i].idx);
		// }
		// }
	}
}