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.util.NavigableSet;
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.io.PrintWriter;
import java.io.Writer;
import java.io.IOException;
import java.util.Arrays;
import java.util.TreeSet;
import java.io.InputStream;
import java.util.Collection;
import java.io.OutputStreamWriter;
import java.util.Comparator;
import java.util.AbstractCollection;

/**
 * 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(0, 0, -1);
        p[n + 1] = new Point(maxX, 0, -1);
        p[n + 2] = new Point(0, maxY, -1);
        TreeSet<Point> onlyDifferent = new TreeSet<Point>(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);
            }
        });
        for (Point point : p) {
            onlyDifferent.add(point);
        }
        Point[] hull = convexHull(onlyDifferent.toArray(new Point[onlyDifferent.size()]));
        EzIntTreeSet[] sets = new EzIntTreeSet[10001];
        for (int i = 0; i < sets.length; i++) {
            sets[i] = new EzIntTreeSet();
        }
        Point best1 = null;
        Point best2 = null;
        for (Point hp : hull) {
            if (hp.i != -1) {
                if (hp.x == maxX || hp.y == maxY) {
                    if (hp.x == maxX) {
                        if (best1 == null || best1.y < hp.y) {
                            best1 = hp;
                        }
                    }
                    if (hp.y == maxY) {
                        if (best2 == null || best2.x < hp.x) {
                            best2 = hp;
                        }
                    }
                } else {
                    addToAns(sets, hp.x, hp.y);
                }
            }
        }
        if (best1 == null || best2 == null || best1.y == 0 || best2.x == 0) {
            throw new IllegalStateException();
        }
        if (best1.x == best2.x) {
            addToAns(sets, best1.x, Math.max(best1.y, best2.y));
        } else if (best1.y == best2.y) {
            addToAns(sets, Math.max(best1.x, best2.x), best1.y);
        } else {
            addToAns(sets, best1.x, best1.y);
            addToAns(sets, best2.x, best2.y);
        }
        EzIntTreeSet ans = new EzIntTreeSet();
        for (Point hp : p) {
            if (hp.i != -1) {
                int x = (int) hp.x;
                int y = (int) hp.y;
                if (sets[x].contains(y)) {
                    ans.add(hp.i + 1);
                }
            }
        }
        out.printLine(ans.toArray());
    }

    private void addToAns(EzIntTreeSet[] sets, long x, long y) {
        sets[(int) x].add((int) y);
    }

    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(int[] array) {
        for (int i = 0; i < array.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.print(array[i]);
        }
    }

    public void printLine(int[] array) {
        print(array);
        writer.println();
    }

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

}

class EzIntTreeSet implements EzIntSortedSet {
    private static final int DEFAULT_CAPACITY = 10;
    private static final double ENLARGE_SCALE = 2.0;
    private static final int HASHCODE_INITIAL_VALUE = 0x811c9dc5;
    private static final int HASHCODE_MULTIPLIER = 0x01000193;

    private static final boolean BLACK = false;
    private static final boolean RED = true;
    private static final int NULL = 0;

    private int[] key;
    private int[] left;
    private int[] right;
    private int[] p;
    private boolean[] color;

    private int size;
    private int root;
    private boolean returnedNull;

    public EzIntTreeSet() {
        this(DEFAULT_CAPACITY);
    }

    public EzIntTreeSet(int capacity) {
        if (capacity < 0) {
            throw new IllegalArgumentException("Capacity must be non-negative");
        }
        capacity++;
        key = new int[capacity];
        left = new int[capacity];
        right = new int[capacity];
        p = new int[capacity];
        color = new boolean[capacity];
        color[NULL] = BLACK;
        size = 0;
        root = NULL;
        returnedNull = false;
    }

    public boolean contains(int element) {
        int x = root;
        while (x != NULL) {
            if (element < key[x]) {
                x = left[x];
            } else if (element > key[x]) {
                x = right[x];
            } else {
                return true;
            }
        }
        return false;
    }

    public int[] toArray() {
        int[] result = new int[size];
        for (int i = 0, x = firstNode(); x != NULL; x = successorNode(x), i++) {
            result[i] = key[x];
        }
        return result;
    }

    public boolean add(int element) {
        int y = NULL;
        int x = root;
        while (x != NULL) {
            y = x;
            if (element < key[x]) {
                x = left[x];
            } else if (element > key[x]) {
                x = right[x];
            } else {
                return false;
            }
        }
        if (size == color.length - 1) {
            enlarge();
        }
        int z = ++size;
        key[z] = element;
        p[z] = y;
        if (y == NULL) {
            root = z;
        } else {
            if (element < key[y]) {
                left[y] = z;
            } else {
                right[y] = z;
            }
        }
        left[z] = NULL;
        right[z] = NULL;
        color[z] = RED;
        fixAfterAdd(z);
        return true;
    }

    private int successorNode(int x) {
        if (right[x] != NULL) {
            x = right[x];
            while (left[x] != NULL) {
                x = left[x];
            }
            return x;
        } else {
            int y = p[x];
            while (y != NULL && x == right[y]) {
                x = y;
                y = p[y];
            }
            return y;
        }
    }

    private void fixAfterAdd(int z) {
        while (color[p[z]] == RED) {
            if (p[z] == left[p[p[z]]]) {
                int y = right[p[p[z]]];
                if (color[y] == RED) {
                    color[p[z]] = BLACK;
                    color[y] = BLACK;
                    color[p[p[z]]] = RED;
                    z = p[p[z]];
                } else {
                    if (z == right[p[z]]) {
                        z = p[z];
                        rotateLeft(z);
                    }
                    color[p[z]] = BLACK;
                    color[p[p[z]]] = RED;
                    rotateRight(p[p[z]]);
                }
            } else {
                int y = left[p[p[z]]];
                if (color[y] == RED) {
                    color[p[z]] = BLACK;
                    color[y] = BLACK;
                    color[p[p[z]]] = RED;
                    z = p[p[z]];
                } else {
                    if (z == left[p[z]]) {
                        z = p[z];
                        rotateRight(z);
                    }
                    color[p[z]] = BLACK;
                    color[p[p[z]]] = RED;
                    rotateLeft(p[p[z]]);
                }
            }
        }
        color[root] = BLACK;
    }

    private void rotateLeft(int x) {
        int y = right[x];
        right[x] = left[y];
        if (left[y] != NULL) {
            p[left[y]] = x;
        }
        p[y] = p[x];
        if (p[x] == NULL) {
            root = y;
        } else {
            if (x == left[p[x]]) {
                left[p[x]] = y;
            } else {
                right[p[x]] = y;
            }
        }
        left[y] = x;
        p[x] = y;
    }

    private void rotateRight(int x) {
        int y = left[x];
        left[x] = right[y];
        if (right[y] != NULL) {
            p[right[y]] = x;
        }
        p[y] = p[x];
        if (p[x] == NULL) {
            root = y;
        } else {
            if (x == right[p[x]]) {
                right[p[x]] = y;
            } else {
                left[p[x]] = y;
            }
        }
        right[y] = x;
        p[x] = y;
    }

    private void enlarge() {
        int newLength = Math.max(color.length + 1, (int) (color.length * ENLARGE_SCALE));
        key = Arrays.copyOf(key, newLength);
        left = Arrays.copyOf(left, newLength);
        right = Arrays.copyOf(right, newLength);
        p = Arrays.copyOf(p, newLength);
        color = Arrays.copyOf(color, newLength);
    }

    private int firstNode() {
        int x = root;
        while (left[x] != NULL) {
            x = left[x];
        }
        return x;
    }

    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        EzIntTreeSet that = (EzIntTreeSet) o;

        if (size != that.size) {
            return false;
        }
        for (int x = firstNode(), y = that.firstNode();
             x != NULL;
             x = successorNode(x), y = that.successorNode(y)
        ) {
            if (key[x] != that.key[y]) {
                return false;
            }
        }
        return true;
    }

    public int hashCode() {
        int hash = HASHCODE_INITIAL_VALUE;
        for (int x = firstNode(); x != NULL; x = successorNode(x)) {
            hash = (hash ^ PrimitiveHashCalculator.getHash(key[x])) * HASHCODE_MULTIPLIER;
        }
        return hash;
    }

    public String toString() {
        StringBuilder sb = new StringBuilder();
        sb.append('[');
        for (int x = firstNode(); x != NULL; x = successorNode(x)) {
            if (sb.length() > 1) {
                sb.append(", ");
            }
            sb.append(key[x]);
        }
        sb.append(']');
        return sb.toString();
    }

}

interface EzIntSortedSet extends EzIntSet {

    boolean equals(Object object);

    int hashCode();

    String toString();

}

interface EzIntCollection {

    boolean equals(Object object);

    int hashCode();

    String toString();
}

class PrimitiveHashCalculator {

    public static int getHash(int x) {
        return x;
    }

}

interface EzIntSet extends EzIntCollection {

    boolean equals(Object object);

    int hashCode();

    String toString();
}

