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.TreeSet;
import java.util.ArrayList;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.List;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.util.Collections;
import java.util.Comparator;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Set;
import java.util.StringTokenizer;

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

class TaskC {
    
    final double EPS = 1e-9;
    
    Set<PairInt> hull = new TreeSet<>();
    Set<PairInt> all = new TreeSet<>();

    void buildConvexHull(ArrayList<Point2DRational> p) {
        int pos = 0;
        int n = p.size();
        for (int i = 0; i < n; i++) {
            Point2DRational cur = p.get(i);
            Point2DRational best = p.get(pos);
            if (cur.x.compareTo(best.x) < 0 || cur.x.equals(best.x) && cur.y.compareTo(best.y) < 0)
                pos = i;
        }
        Collections.swap(p, 0, pos);
        Point2DRational p0 = p.get(0);
        ArrayList<Point2DRational> tail = new ArrayList<>();
        for (int i = 1; i < n; i++)
            if (!p.get(i).x.equals(p0.x))
                tail.add(p.get(i));
        Collections.sort(tail, new Comparator<Point2DRational>() {
            public int compare(Point2DRational o1, Point2DRational o2) {
                Point2DRational d1 = o1.subtract(p0);
                Point2DRational d2 = o2.subtract(p0);
                double prod = d1.doubleCrossProduct(d2);
                if (prod > EPS)
                    return -1;
                if (prod < EPS)
                    return 1;
                return Double.compare(o1.distance(p0), o2.distance(p0));
            }
        });
        //System.err.println(p0);
        //System.err.println(tail);
        ArrayList<Point2DRational> stack = new ArrayList<>();
        stack.add(p0);
        for (Point2DRational cur : tail) {
            for (;;) {
                if (stack.size() < 2)
                    break;
                int sz = stack.size();
                Point2DRational last = stack.get(sz - 1);
                Point2DRational prev = stack.get(sz - 2);
                Point2DRational diff1 = cur.subtract(last);
                Point2DRational diff2 = last.subtract(prev);
                if (diff1.doubleCrossProduct(diff2) > EPS)
                    stack.remove(sz - 1);
                else
                    break;
            }
            stack.add(cur);
        }
        Rational minY = p0.y;
        for (Point2DRational cur : tail)
            if (minY.compareTo(cur.y) > 0)
                minY = cur.y;
        //System.err.println(stack);
        while (stack.size() >= 2
                && (stack.get(stack.size() - 1).y.compareTo(stack.get(stack.size() - 2).y) >= 0)
                || stack.get(stack.size() - 1).y.compareTo(minY) > 0)
            stack.remove(stack.size() - 1);
        //System.err.println(stack);
        for (Point2DRational cur : stack)
            hull.add(new PairInt((int) cur.x.denom, (int) cur.y.denom));
        hull.add(new PairInt((int) p0.x.denom, (int) p0.y.denom));
    }

    public void solve(int testNumber, FastScanner in, PrintWriter out) {
        int n = in.nextInt();
        PairInt[] p = new PairInt[n];
        for (int i = 0; i < n; i++) {
            p[i] = new PairInt(in.nextInt(), in.nextInt());
            all.add(p[i]);
        }
        ArrayList<Point2DRational> unique = new ArrayList<>();
        for (PairInt elem : all)
            unique.add(new Point2DRational(new Rational(1, elem.first),
                    new Rational(1, elem.second)));
        buildConvexHull(unique);
        for (int i = 0; i < n; i++)
            if (hull.contains(p[i]))
                out.print(i + 1 + " ");
    }

}

class PairInt implements Comparable<PairInt> {
    public int first;
    public int second;

    /**
     * Creates a new {@code PairInt}.
     * @param first The first element of the pair.
     * @param second The second element of the pair.
     */
    public PairInt(int first, int second) {
        this.first = first;
        this.second = second;
    }

    /**
     * Compares two pairs in lexicographical order(first by their first element and they be the
     * second).
     *
     * @param p Another pair. Must be non-null.
     */
    public int compareTo(PairInt p) {
        if (first != p.first) {
            return Integer.compare(first, p.first);
        }
        return Integer.compare(second, p.second);
    }

    public int hashCode() {
        return first * 1_000_003 + second;
    }

    /**
     * Returns true iff o is an instance of {@code PairInt} and the first and the second elements
     * of these two pairs are equal.
     *
     * @param o Another pair.
     */
    public boolean equals(Object o) {
        if (!(o instanceof PairInt)) {
            return false;
        }
        PairInt p = (PairInt) o;
        return first == p.first && second == p.second;
    }
}

class Point2DRational {

    public final Rational x;
    public final Rational y;

    public Point2DRational(Rational x, Rational y) {
        this.x = x;
        this.y = y;
    }

    public Point2DRational subtract(Point2DRational other) {
        return new Point2DRational(x.subtract(other.x), y.subtract(other.y));
    }

    public double distance(Point2DRational other) {
        return Math.sqrt(square(x.toDouble() -  other.x.toDouble()) + square(y.toDouble()
                - other.y.toDouble()));
    }

    public double doubleCrossProduct(Point2DRational other) {
        double x1 = x.toDouble();
        double y1 = y.toDouble();
        double x2 = x.toDouble();
        double y2 = y.toDouble();
        return x1 * y2 - x2 * y1;
    }

    public String toString() {
        return "{Point " + x + " " + y + " }";
    }

    private static double square(double a) {
        return a * a;
    }
}

class Rational implements Comparable<Rational> {

    public final long num;
    public final long denom;

    public Rational(long num, long denom) {
        if (denom < 0)
            throw new AssertionError("negative denominator");
        this.num = num;
        this.denom = denom;
    }

    public Rational subtract(Rational other) {
        return new Rational(num * other.denom - denom * other.num, denom * other.denom);
    }

    public double toDouble() {
        return (double) num / denom;
    }

    public int compareTo(Rational other) {
        return Long.signum(num * other.denom - denom * other.num);
    }

    public boolean equals(Object o) {
        if (!(o instanceof Rational))
            return false;
        Rational r = (Rational) o;
        return compareTo(r) == 0;
    }

    public String toString() {
        return num + "/" + denom;
    }
}

class FastScanner {
    private StringTokenizer tokenizer;
    private BufferedReader reader;

    public FastScanner(InputStream inputStream) {
        reader = new BufferedReader(new InputStreamReader(inputStream));
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            String line = null;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                // ignore
            }
            if (line == null)
                return null;
            tokenizer = new StringTokenizer(line);
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}

