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.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class CF299E {
    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer strtok;
        strtok = new StringTokenizer(in.readLine());
        int n = Integer.parseInt(strtok.nextToken());
        int[][] lines = new int[n][3];
        for (int i = 0; i < lines.length; i++) {
            strtok = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(strtok.nextToken());
            int b = Integer.parseInt(strtok.nextToken());
            lines[i][0] = b - a;
            lines[i][1] = a;
            lines[i][2] = i;
        }
        ArrayDeque<int[]> q = new ArrayDeque<int[]>();
        Arrays.sort(lines, (a, b) -> {
            if (a[0] != b[0])
                return Integer.compare(a[0], b[0]);
            return -Integer.compare(a[1], b[1]);
        });
        for (int i = 0; i < n; i++) {
            while (!q.isEmpty()) {
                int[] prev = q.pollLast();
                int dM = lines[i][0] - prev[0];
                int dC = lines[i][1] - prev[1];
                if (dM == 0) {
                    continue;
                } else if (!q.isEmpty()) {
                    int[] pprev = q.pollLast();
                    int dMm = prev[0] - pprev[0];
                    int dCc = prev[1] - pprev[1];
                    if (dCc * dM >= dC * dMm) {
                        q.add(pprev);
                        q.add(prev);
                        break;
                    } else
                        q.add(pprev);
                } else {
                    q.add(prev);
                    break;
                }
            }
            q.add(lines[i]);
        }
        TreeSet<Integer> finaloutput = new TreeSet<Integer>();
        ArrayList<Integer> qarr = new ArrayList<Integer>();
        int[][] good = new int[q.size()][];
        int t = 0;
        for (int[] a : q)
            good[t++] = a;
        for (int i = 0; i < good.length; i++) {
            if (i == good.length - 1) {
                qarr.add(good[i][2]);
                break;
            }
            int dM = good[i + 1][0] - good[i][0];
            int dC = good[i + 1][1] - good[i][1];
            if (-dC < 0)
                continue;
            qarr.add(good[i][2]);
            if (-dC >= dM)
                break;
        }
        if (n == 200000) {
            System.out.println(Arrays.toString(good));
        }
        TreeSet<int[]> optimal = new TreeSet<int[]>((a, b) -> {
            if (a[0] != b[0])
                return Integer.compare(a[0], b[0]);
            return Integer.compare(a[1], b[1]);
        });
        
        for (int i : qarr) {
            optimal.add(new int[] { lines[i][0], lines[i][1] });
        }
        for (int i = 0; i < lines.length; i++) {
            if (optimal.contains(new int[] { lines[i][0], lines[i][1] })) {
                finaloutput.add(lines[i][2] + 1);
            }
        }
        for (int i : finaloutput)
            System.out.print(i + " ");
        System.out.println();
    }
}
