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.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long max1 = 0;
        long max2 = 0;
        long max3 = 0;
        Map<Long, List<Long>> values1 = new HashMap<Long, List<Long>>(n/4);
        Map<Long, List<Long>> values2 = new HashMap<Long, List<Long>>(n/4);
        Map<Long, List<Long>> values3 = new HashMap<Long, List<Long>>(n/4);
        for(long i = 1; i <= n; i++){
            long s = in.nextLong();
            long r = in.nextLong();
            if(s == 0 || r == 0) continue;
            long sum1 = 10000 * r + s;
            long sum2 = r + 10000 * s;
            long sum3 = 5000 * r + 5000 * s;

            if(sum1 > max1) max1 = sum1;
            if(sum2 > max2) max2 = sum2;
            if(sum3 > max3) max3 = sum3;

            if(sum1 == max1){
                List<Long> positions1 = values1.get(sum1);
                if(positions1 != null){
                    positions1.add(i);
                } else {
                    List<Long> speeds = new ArrayList<Long>();
                    speeds.add(i);
                    values1.put(sum1, speeds);
                }
            }
            if(sum2 == max2){
                List<Long> positions2 = values2.get(sum2);
                if(positions2 != null){
                    positions2.add(i);
                } else {
                    List<Long> speeds = new ArrayList<Long>();
                    speeds.add(i);
                    values2.put(sum2, speeds);
                }
            }
            if(sum3 == max3){
                List<Long> positions3 = values3.get(sum3);
                if(positions3 != null){
                    positions3.add(i);
                } else {
                    List<Long> speeds = new ArrayList<Long>();
                    speeds.add(i);
                    values3.put(sum3, speeds);
                }
            }
        }
        SortedSet<Integer> positions = new TreeSet<Integer>();
        Collection<Long> coll1 = values1.get(max1);
        if(coll1 != null && coll1.size() > 0)
        for(Long val: coll1){
            positions.add(val.intValue());
        }

        Collection<Long> coll2 = values2.get(max2);
        if(coll2 != null && coll2.size() > 0)
        for(Long val: coll2){
            positions.add(val.intValue());
        }

        Collection<Long> coll3 = values3.get(max3);
        if(coll3 != null && coll3.size() > 0)
        for(Long val: coll3){
            positions.add(val.intValue());
        }

        StringBuilder str = new StringBuilder();
        for(Integer val: positions){
            str.append(val + " ");
        }
        p(str);
    }

    static void p(Object str){
        System.out.println(str);
    }
}
