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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

/**
 * Created by Charlie Tunoku on 4/14/2015.
 */
public class C {
    private static StringTokenizer st;
    private static BufferedReader br;
    public static long MOD = 1000000007;
    public static double EPS = 0.00000001;

    public static void print(Object x) {
        System.out.println(x + "");
    }
    public static void printArr(long[] x) {
        StringBuilder s = new StringBuilder();
        for (int i = 0; i < x.length; i++) {
            s.append(x[i] + " ");
        }
        print(s);
    }
    public static void printArr(int[] x) {
        StringBuilder s = new StringBuilder();
        for (int i = 0; i < x.length; i++) {
            s.append(x[i] + " ");
        }
        print(s);
    }
    public static String join(Collection<?> x, String space) {
        if (x.size() == 0) return "";
        StringBuilder sb = new StringBuilder();
        boolean first = true;
        for (Object elt : x) {
            if (first) first = false;
            else sb.append(space);
            sb.append(elt);
        }
        return sb.toString();
    }

    public static String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            st = new StringTokenizer(line.trim());
        }
        return st.nextToken();
    }
    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static class Point {
        long r;
        long s;

        public Point(int r, int s) {
            this.r = r;
            this.s = s;
        }

        @Override
        public int hashCode() {
            return (int) (r + 20000 * s);
        }

        @Override
        public boolean equals(Object obj) {
            if (obj instanceof Point) {
                Point p = (Point) obj;
                return p.r == r && p.s == s;
            }
            return false;
        }
    }

    public static boolean cw(Point a, Point b, Point c) {
        long orient = b.r*a.s*(c.r-a.r)*(c.s-b.s) - a.r*b.s*(c.s-a.s)*(c.r-b.r);
        return orient < 0;
    }

    public static List<Point> solve(List<Point> points) {
        Collections.sort(points, new Comparator<Point>() {
            @Override
            public int compare(Point o1, Point o2) {
                if (o1.r == o2.r) return (int) Math.signum(o1.s - o2.s);
                return (int) Math.signum(o2.r - o1.r);
            }
        });

        List<Point> lowerHull = new ArrayList<Point>();

        for (Point p : points) {
            while (lowerHull.size() > 1) {
                int m = lowerHull.size();
                Point p1 = lowerHull.get(m-2);
                Point p2 = lowerHull.get(m-1);
                if (cw(p1, p2, p)) {
                    lowerHull.remove(lowerHull.size() - 1);
                }
                else break;
            }
            lowerHull.add(p);
        }

        List<Point> winners = new ArrayList<Point>();
        winners.add(lowerHull.get(0));
        for (Point p : lowerHull) {
            Point last = winners.get(winners.size() - 1);
            if (p.s < last.s) break;
            winners.add(p);
        }

        return winners;
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));

        int n = nextInt();

        Map<Point, List<Integer>> ids = new HashMap<Point, List<Integer>>();
        List<Point> points = new ArrayList<Point>();
        for (int i = 1; i <= n; i++) {
            Point p = new Point(nextInt(), nextInt());
            if (!ids.containsKey(p)) {
                ids.put(p, new ArrayList<Integer>());
                points.add(p);
            }
            ids.get(p).add(i);
        }
        List<Point> winners = solve(points);
        Set<Integer> winnerIDs = new HashSet<Integer>();
        for (Point p : winners) {
            winnerIDs.addAll(ids.get(p));
        }
        List<Integer> sorted = new ArrayList<Integer>(winnerIDs);
        Collections.sort(sorted);
        print(join(sorted, " "));
    }
}
