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.Arrays;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Comparator;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * 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);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskC {
    static class Contestant {
        int s;
        int r;
        Contestant nextSame;
        boolean canWin;
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();

        Contestant[] contestants = new Contestant[n];
        for (int i = 0; i < n; ++i) {
            contestants[i] = new Contestant();
            contestants[i].s = in.nextInt();
            contestants[i].r = in.nextInt();
        }

        doit(contestants.clone());

        boolean first = true;
        for (int i = 0; i < n; ++i) if (contestants[i].canWin) {
            if (first) first = false; else out.print(" ");
            out.print(i + 1);
        }
        out.println();
    }

    private void doit(Contestant[] contestants) {
        Arrays.sort(contestants, new Comparator<Contestant>() {
            public int compare(Contestant o1, Contestant o2) {
                int z = o2.r - o1.r;
                if (z == 0) z = o2.s - o1.s;
                return z;
            }
        });
        int cnt = 0;
        for (int i = 0; i < contestants.length; ++i) {
            contestants[cnt++] = contestants[i];
            if (cnt >= 2 && contestants[cnt - 1].s <= contestants[cnt - 2].s) {
                if (contestants[cnt - 1].s == contestants[cnt - 2].s && contestants[cnt - 1].r == contestants[cnt - 2].r) {
                    contestants[cnt - 1].nextSame = contestants[cnt - 2];
                    contestants[cnt - 2] = contestants[cnt - 1];
                }
                --cnt;
            } else {
                while (cnt >= 3) {
                    Contestant a = contestants[cnt - 3];
                    Contestant b = contestants[cnt - 2];
                    Contestant c = contestants[cnt - 1];
                    if ((a.r - b.r) * (long) c.r * (b.s - c.s) * a.s - (a.s - b.s) * (long) c.s * (b.r - c.r) * a.r < 0) {
                        contestants[cnt - 2] = c;
                        --cnt;
                    } else {
                        break;
                    }
                }
            }
        }
        for (int i = 0; i < cnt; ++i) {
            Contestant cur = contestants[i];
            while (cur != null) {
                cur.canWin = true;
                cur = cur.nextSame;
            }
        }
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

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

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

}