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.*;
import java.util.*;

public class C {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    class Player implements Comparable<Player> {
        long s;
        long r;
        Point point;
        List<Integer> indexes;

        public Player(long s, long r, int index) {
            this.s = s;
            this.r = r;
            this.point = new Point(this);
            this.indexes = new ArrayList<Integer>();
            indexes.add(index);
        }

        public int compareTo(Player other) {
            if (this.s > other.s) return -1;
            if (this.s < other.s) return 1;
            if (this.r > other.r) return -1;
            if (this.r < other.r) return 1;
            return 0;
        }
    }

    void solve() throws IOException {
        int n = readInt();
        Player[] players = new Player[n];
        for (int i = 0; i < n; i++) {
            players[i] = new Player(readInt(), readInt(), i + 1);
        }
        Arrays.sort(players);
        boolean[] can = new boolean[n];
        can[0] = true;
        long max = players[0].r;
        List<Player> potWins = new ArrayList<Player>();
        for (int i = 1; i < n; i++) {
            if (players[i].compareTo(players[i - 1]) == 0) {
                can[i] = can[i - 1];
            }
            if (players[i].r > max) {
                max = players[i].r;
                can[i] = true;
            }
        }
        for (int i = 0; i < n; i++) {
            if (can[i]) {
                potWins.add(players[i]);
            }
        }

        Stack<Player> stack = new Stack<Player>();
        stack.push(potWins.get(0));
        for(int i = 1; i < potWins.size(); i++) {
            Player cur = potWins.get(i);
            if(cur.compareTo(stack.peek()) == 0) {
                stack.peek().indexes.addAll(cur.indexes);
                continue;
            }
            while (stack.size() != 1) {
                Player prev = stack.pop();
                Player prev2 = stack.peek();
                if(check(prev2.point, prev.point, cur.point)) {
                    stack.push(prev);
                    break;
                }
            }
            stack.push(cur);
        }

        List<Integer> nums = new ArrayList<Integer>();
        while (!stack.empty()) {
            nums.addAll(stack.pop().indexes);
        }
        Collections.sort(nums);
        for(int i: nums) {
            out.print(i + " ");
        }
    }

    class Drobe {
        long up;
        long down;

        Drobe(long up, long down) {
            this.up = up;
            this.down = down;
        }

        Drobe mult(Drobe a, Drobe b) {
            return new Drobe(a.up * b.up, a.down * b.down);
        }

        Drobe add(Drobe a, Drobe b) {
            return new Drobe(a.up * b.down + b.up * a.down, a.down * b.down);
        }

        Drobe sub(Drobe a, Drobe b) {
            return new Drobe(a.up * b.down - b.up * a.down, a.down * b.down);
        }

        Drobe mult(Drobe b) {
            return mult(this, b);
        }

        Drobe sub(Drobe b) {
            return sub(this, b);
        }
    }

    class Point {
        Drobe x;
        Drobe y;

        Point(Player player) {
            this.x = new Drobe(1, player.s);
            this.y = new Drobe(1, player.r);
        }
    }

    boolean check(Point a, Point b, Point c) {
        Drobe first = b.x.sub(a.x).mult(c.y.sub(a.y));
        Drobe second = b.y.sub(a.y).mult(c.x.sub(a.x));
        return first.up * second.down >= first.down * second.up;
    }


    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    int[] readArr(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = readInt();
        }
        return res;
    }

    long[] readArrL(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = readLong();
        }
        return res;
    }

    public static void main(String[] args) {
        new C().run();
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }
}