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

public class Problem {
    BufferedReader br;
    //PrintWriter out;
    StringTokenizer st;
    boolean eof;
    
    public class Line {
        public double a, b;
        public int i;
        double xinter(Line l) { //l.a != a
            /*if(l.a == a) 
                return -1e35;*/
            return (l.b - b) / (a - l.a);
        }
    }
    public static void main(String[] args) throws IOException{
        new Problem();
    }
    
    Problem() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        //read input
        int n = nextInt();
        //System.out.println(n);
        Line[] L = new Line[n];
        for (int i = 0; i < n; i++) {
            L[i] = new Line();
            L[i].b = 1000000 / nextDouble();
            L[i].a = 1 / nextDouble();
            L[i].i = i;
        }
        //sort by slope
        Arrays.sort(L, (l1, l2) -> (l1.a > l2.a || (l1.a == l2.a && l1.b > l2.b))? -1 : 1);
        //construct upper hull
        Line[] a = new Line[n];
        int sz = 0;
        for(int i = 0; i < n; i++) {
            if(i < n - 1 && L[i].a == L[i + 1].a) continue;
            if(sz < 2) {
                if(sz == 1 && a[0].a == L[i].a) 
                    sz--;
                
                a[sz++] = L[i];
                continue;
            }
            int p = sz - 1, pp = sz - 2;
            while(sz > 1 && L[i].xinter(a[p]) - L[i].xinter(a[pp]) < -1e-9) {
                sz--; p--; pp--;
            }
            a[sz++] = L[i];
        }
        ///print answer
        Arrays.sort(a, 0, sz, (x, y) -> x.i - y.i);
        for(int i = 0; i < sz; i++) {
            System.out.print((a[i].i + 1) + " ");
        }
    }
    
    
    String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}