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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Writer;
import java.security.DomainCombiner;
import java.util.*;


public class C 
{
    public static void main(String [] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter writer = new PrintWriter(System.out);
        
        int n = Integer.parseInt(reader.readLine());
        long [][] competitors = new long[n][];
        for(int i = 0 ; i < n ; i++)
        {
            StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
            int s = Integer.parseInt(tokenizer.nextToken());
            int r = Integer.parseInt(tokenizer.nextToken());
            
            competitors[i] = new long[]{s, r, i+1};
        }
        
        Arrays.sort(competitors, new Comparator<long[]>() {

            @Override
            public int compare(long[] a, long[] b) 
            {
                if(a[0] != b[0])
                    return Long.compare(b[0], a[0]);
                else if(a[1] != b[1])
                    return Long.compare(b[1], a[1]);
                else
                    return Long.compare(a[2], b[2]);
            }
            
        });
        long [][] q1 = new long[n][];
        int a1 = 0;
        q1[a1++] = competitors[0];
        for(int i = 1 ; i < n ; i++)
        {
            while(a1 > 1 && ccw(q1[a1-2], q1[a1-1], competitors[i]) >= 0)
                    a1--;
            q1[a1++] = competitors[i];
        }
        long [][] q2 = new long[n][];
        int a2 = 0;
        q2[a2++] = competitors[0];
        for(int i = 1 ; i < n ; i++)
        {
            while(a2 > 1 && ccw(q2[a2-2], q2[a2-1], competitors[i]) <= 0)
                a2--;
            q2[a2++] = competitors[i];
        }
        int size = a1 + a2 - 2;
        if(size < 3)
        {
            for(int i = 1 ; i <= n ; i++)
                writer.print(i+" ");
            writer.println();
            writer.flush();
            writer.close();
            
            return;
        }
        long [][] res = new long[size][];
        int at = 0;
        for(int i = 0 ; i < a1 ; i++)
            res[at++] = q1[i];
        for(int i = a2 - 2 ; i > 0 ; i--)
            res[at++] = q2[i];
        
        writer.println(res.length);
        int leftMostIdx = 0;
        int downMostIdx = 0;
        
        for(int i = 0 ; i < res.length ; i++)
        {
            if(res[i][0] > res[leftMostIdx][0])
                leftMostIdx = i;
            else if(res[i][0] == res[leftMostIdx][0] && res[i][1] > res[leftMostIdx][1])
                leftMostIdx = i;
            
            if(res[i][1] > res[downMostIdx][1])
                downMostIdx = i;
            else if(res[i][1] == res[downMostIdx][1] && res[i][0] > res[downMostIdx][0])
                downMostIdx = i;
        }
        
        at = downMostIdx;
        ArrayList<Integer> ret = new ArrayList<Integer>();
        while(true)
        {
            ret.add((int)res[at][2]);
            if(at == leftMostIdx)
                break;
            at++;
            at %= res.length;
        }
        Collections.sort(ret);;
        for(int i = 0 ; i < ret.size() ; i++)
            writer.print(ret.get(i)+" ");
        writer.println();
        
        writer.flush();
        writer.close();
        
    }
    
    private static long ccw(long[] a, long[] b,long[] c)
    {
        long u1 = (a[0]-b[0])*(a[1]-c[1]);
        
        long u2 = (a[1]-b[1])*(a[0]-c[0]);
    
        return Long.compare(u1*b[1]*c[0], u2*b[0]*c[1]);  
    }
    
}
