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.BufferedWriter;
import java.util.InputMismatchException;
import java.util.ArrayList;
import java.util.List;
import java.util.NoSuchElementException;
import java.math.BigInteger;
import java.io.OutputStream;
import java.util.Collections;
import java.io.PrintWriter;
import java.io.Writer;
import java.io.IOException;
import java.util.Arrays;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.Comparator;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {
    static class Point {
        long x, y;
        int i;

        public Point(long x, long y, int i) {
            this.x = x;
            this.y = y;
            this.i = i;
        }
    }

    public void solve(int testNumber, InputReader in, OutputWriter out) {
        int n = in.readInt();
        Point[] p = new Point[n + 3];
        for (int i = 0; i < n; i++) {
            p[i] = new Point(in.readLong(), in.readLong(), i);
        }
        long maxX = 0;
        long maxY = 0;
        for (int i = 0; i < n; i++) {
            maxX = Math.max(maxX, p[i].x);
            maxY = Math.max(maxY, p[i].y);
        }
        p[n] = new Point(maxX, 0, -1);
        p[n + 1] = new Point(0, maxY, -1);
        p[n + 2] = new Point(0, 0, -1);
        Point[] hull = convexHull(p);
        List<Integer> ans = new ArrayList<Integer>();
        Point bestWithMaxX = null;
        Point bestWithMaxY = null;
        for (Point hp : hull) {
            if (hp.i != -1) {
                if (hp.x == maxX || hp.y == maxY) {
                    if (hp.x == maxX) {
                        if (bestWithMaxX == null || bestWithMaxX.y < hp.y) {
                            bestWithMaxX = hp;
                        }
                    }
                    if (hp.y == maxY) {
                        if (bestWithMaxY == null || bestWithMaxY.x < hp.x) {
                            bestWithMaxY = hp;
                        }
                    }
                } else {
                    ans.add(hp.i);
                }
            }
        }
        if (bestWithMaxX == null || bestWithMaxY == null || bestWithMaxX.y == 0 || bestWithMaxY.x == 0) {
            throw new IllegalStateException();
        }
        ans.add(bestWithMaxX.i);
        if (bestWithMaxX.i != bestWithMaxY.i) {
            ans.add(bestWithMaxY.i);
        }
        Collections.sort(ans);
        for (int i = 0; i < ans.size(); i++) {
            out.print(ans.get(i) + 1);
            if (i == ans.size() - 1) out.printLine(); else out.print(" ");
        }
    }

    boolean cw(Point a, Point b, Point c) {
        return a.x*(b.y-c.y) + b.x*(c.y-a.y) + c.x*(a.y-b.y) <= 0;
    }

    boolean ccw(Point a, Point b, Point c) {
        return a.x*(b.y-c.y) + b.x*(c.y-a.y) + c.x*(a.y-b.y) >= 0;
    }

    Comparator<Point> cmp = new Comparator<Point>() {
        public int compare(Point a, Point b) {
            if (a.x != b.x) {
                return Long.compare(a.x, b.x);
            }
            return Long.compare(a.y, b.y);
        }
    };

    Point[] convexHull(Point[] p) {
        int n = p.length;
        if (n == 1) {
            return Arrays.copyOf(p, n);
        }
        Arrays.sort(p, cmp);
        List<Point> up = new ArrayList<Point>();
        List<Point> down = new ArrayList<Point>();
        up.add(p[0]);
        down.add(p[0]);
        for (int i = 1; i < n; i++) {
            if (i == n-1 || cw(p[0], p[i], p[n-1])) {
                while (up.size() >= 2 && !cw(up.get(up.size()-2), up.get(up.size()-1), p[i])) {
                    up.remove(up.size()-1);
                }
                up.add(p[i]);
            }
            if (i == n-1 || ccw(p[0], p[i], p[n-1])) {
                while (down.size() >= 2 && !ccw(down.get(down.size()-2), down.get(down.size()-1), p[i])) {
                    down.remove(down.size()-1);
                }
                down.add(p[i]);
            }
        }
        Point[] res = new Point[up.size() + down.size() - 2];
        int k = 0;
        for (int i = 0; i < up.size(); i++) {
            res[k++] = up.get(i);
        }
        for (int i = down.size()-2; i >= 1; i--) {
            res[k++] = down.get(i);
        }
        return res;
    }
}

class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public long readLong() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return isWhitespace(c);
	}

	public static boolean isWhitespace(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

    public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public void print(Object...objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void printLine() {
		writer.println();
	}

	public void close() {
		writer.close();
	}

	public void print(int i) {
		writer.print(i);
	}

}

