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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Vadim Semenov
 */
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 {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int counter = in.nextInt();
        int[] s = new int[counter];
        int[] r = new int[counter];
        for (int i = 0; i < counter; ++i) {
            s[i] = in.nextInt();
            r[i] = in.nextInt();
        }
        int[] ss = Arrays.copyOf(s, counter);
        int[] rr = Arrays.copyOf(r, counter);
        Arrays.sort(ss);
        Arrays.sort(rr);
        int sp = 1;
        int rp = 1;
        for (int i = 1; i < counter; ++i) {
            if (ss[i] != ss[i - 1]) {
                ss[sp++] = ss[i];
            }
            if (rr[i] != rr[i - 1]) {
                rr[rp++] = rr[i];
            }
        }
        for (int i = 0; i < counter; ++i) s[i] = Arrays.binarySearch(ss, 0, sp, s[i]);
        for (int i = 0; i < counter; ++i) r[i] = Arrays.binarySearch(rr, 0, rp, r[i]);

        Integer[] byS = new Integer[counter];
        for (int i = 0; i < counter; ++i) byS[i] = i;
        Arrays.sort(byS, new Comparator<Integer>() {
            public int compare(Integer first, Integer second) {
                return -Integer.compare(s[first], s[second]);
            }
        });
        int[] stack = new int[counter];
        int top = 0;
        for (int i = 0; i < counter; ++i) {
            int current = byS[i];
            while (top > 0 && ss[s[current]] == ss[s[stack[top - 1]]] && rr[r[current]] > rr[r[stack[top - 1]]]) {
                --top;
            }
            while (top > 1) {
                int fst = stack[top - 2];
                int snd = stack[top - 1];
                int thr = current;
                long lhs = (long) rr[r[fst]] * ss[s[thr]] * (ss[s[fst]] - ss[s[snd]]) * (rr[r[thr]] - rr[r[snd]]);
                long rhs = (long) rr[r[thr]] * ss[s[fst]] * (ss[s[snd]] - ss[s[thr]]) * (rr[r[snd]] - rr[r[fst]]);
                if (lhs <= rhs) break;
                --top;
            }
            if (top == 0 || (s[stack[top - 1]] == s[current] && r[stack[top - 1]] == r[current]) ||
                    r[stack[top - 1]] < r[current]) {
                stack[top++] = current;
            }
        }
        {
            int lastS = Integer.MAX_VALUE;
            int lastR = -1;
            for (int i = 0; i < top; ++i) {
                if (lastS < s[stack[i]] || lastR > r[stack[i]]) {
                    throw new AssertionError(lastS + " " + s[stack[i]] + " " + lastR + " " + r[stack[i]]);
                }
                lastS = s[stack[i]];
                lastR = r[stack[i]];
            }
        }
//        if (top < 2 && counter > 1) throw new AssertionError(top);
        Arrays.sort(stack, 0, top);
        for (int i = 0; i < top; ++i) {
            if (i > 0) out.print(' ');
            out.print(stack[i] + 1);
        }
        out.println();
    }
}

class InputReader {
    private final BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
    }

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

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(readLine());
        }
        return tokenizer.nextToken();
    }

    public String readLine() {
        String line;
        try {
            line = reader.readLine();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
        return line;
    }
}

