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

public class C {

    final static double EPS = 1E-12;

    static void solve() throws IOException {
        int n = nextInt();
        int[] s = new int[n];
        int[] r = new int[n];
        int ms = -1;
        int mr = -1;
        int mmi = 0;
        for ( int i = 0; i < n; i ++ ) {
            s[i] = nextInt();
            r[i] = nextInt();
            if ( r[i] > mr || ( r[i] == mr && s[i] > ms ) ) {
                ms = s[i];
                mr = r[i];
            }
            if ( s[i] > s[mmi] || ( s[i] == s[mmi] && r[i] > r[mmi] ) ) {
                mmi = i;
            }
        }
        HashMap< String, Integer > unq = new HashMap<>();
        ArrayList<Point> p = new ArrayList<>();
        for ( int i = 0; i < n; i ++ ) {
            String k = s[i] + " " + r[i];
            if ( ! unq.containsKey( k ) ) {
                unq.put( k, i );
                if ( s[i] != ms || r[i] != mr ) {
                    p.add( new Point( i, -1.0 / s[i] + 1.0 / ms, 1.0 / r[i] - 1.0 / mr ) );
                } else {
                    p.add( new Point( i, 0, 0 ) );
                }
            }
        }
        Collections.sort(p, new Comparator<Point>() {
            @Override
            public int compare(Point p1, Point p2) {
                if ( p1.zero() ) {
                    if ( p2.zero() ) {
                        return 0;
                    }
                    return -1;
                }
                if ( p2.zero() ) {
                    return 1;
                }
                double vp = p1.x * p2.y - p2.x * p1.y;
                if ( Math.abs( vp ) < EPS ) {
                    return 0;
                } else if ( vp > 0 ) {
                    return -1;
                } else {
                    return 1;
                }
            }
        });
        boolean[] take = new boolean[n];
        take[p.get( 0 ).i] = true;
        int[] q = new int[p.size()];
        q[0] = 0;
        int ql = 1;
        for ( int i = 1; i < p.size(); i ++ ) {
            while ( ql >= 2 && p.get( q[ql - 1] ).subt( p.get( q[ql - 2] ) ).vect( p.get( i ).subt( p.get( q[ql - 1] ) ) ) < -EPS ) {
                ql --;
            }
            q[ql ++] = i;
            if ( p.get( i ).i == mmi ) {
                break;
            }
        }
        int i = 1;
//        while ( i < ql && p.get( q[i] ).x > p.get( q[i - 1] ).x - EPS ) {
//            take[p.get( q[i] ).i] = true;
//            i ++;
//        }
//        ql = i;
        for ( i = 0; i < ql; i ++ ) {
            take[p.get( q[i] ).i] = true;
        }
        for ( i = 0; i < n; i ++ ) {
            take[i] = take[unq.get( s[i] + " " + r[i] )];
            if ( take[i] ) {
                out.print( ( i + 1 ) + " " );
            }
        }
        out.println();
    }

    private static class Point {
        int i;
        double x;
        double y;

        Point( int I, double X, double Y ) {
            i = I;
            x = X;
            y = Y;
        }

        boolean zero() {
            return x == 0 && y == 0;
        }

        public Point subt(Point p) {
            return new Point( -1, x - p.x, y - p.y );
        }

        public double vect( Point p ) {
            return x * p.y - y * p.x;
        }
    }

    static StreamTokenizer in;
    static PrintWriter out;

    static int nextInt() throws IOException {
        in.nextToken();
        return ( int ) in.nval;
    }

    public static void main( String[] args ) throws IOException {
        in = new StreamTokenizer( new InputStreamReader( System.in ) );
        out = new PrintWriter( System.out );
        solve();
        out.close();
    }
}
