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 


import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.util.StringTokenizer;
import java.io.IOException;
import java.util.Arrays;

public class Problem {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    public class Line {
        public int a, b;
        public int i;
    }
    public static void main(String[] args) throws IOException{
        new Problem();
    }

    public boolean bad2(Line a, Line b, Line c) {
        //if(c.a == 0) return true;
        
        /*long n1 = 1l * a.a * c.a * (c.b - a.b);
        long d1 = 1l * a.b * c.b * (a.a - c.a);
        long n2 = 1l * a.a * b.a * (b.b - a.b);
        long d2 = 1l * a.b * b.b * (a.a - b.a);*/
        
        return 1l*c.a*b.b*(c.b-a.b)*(a.a-b.a) > 1l*b.a*c.b*(b.b-a.b)*(a.a-c.a);
    }
    public boolean bad1(Line a, Line b) {
        return a.b >= b.b;
    }
    
    Problem() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        //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].a = nextInt();
            L[i].b = nextInt();
            L[i].i = i + 1;
        }
        //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;
            while(sz > 1 && bad2(L[i], a[sz-1], a[sz-2]))
                sz--;
            while(sz > 0 && bad1(L[i], a[sz-1])) 
                sz--;
            a[sz++] = L[i];
        }
        ///print answer
        int fsz = sz;
        for(int i = 0, j = 0; i < fsz; i++) {
            while(L[j].a != a[i].a || L[j].b != a[i].b)
                j++;
            while(L[j].a == a[i].a && L[j].b == a[i].b && L[j].i != a[i].i)
                a[sz++] = L[j++];
        }
        
        Arrays.sort(a, 0, sz, (x, y) -> x.i - y.i);
        for(int i = 0; i < sz; i++) {
            out.print((a[i].i) + " ");
        }
        out.close();
    }
    
    
    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());
    }
}