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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;
import java.util.stream.IntStream;

public class CF535E {
	public static void main(String[] args){
		MyScanner sc = new MyScanner();
		int n = sc.nextInt();
		List<Line> v = new ArrayList<>(), vv = new ArrayList<>();
		for (int i = 0; i < n; i++)
			v.add(new Line(i+1,sc.nextInt(),sc.nextInt()));
		Collections.sort(v,(a,b)->a.start != b.start ? b.start - a.start : b.end - a.end);
		v.get(0).m = true;
		for(int i = 0, j = 1; j < n; j++)
			if(v.get(j).start < v.get(i).start && v.get(j).end > v.get(i).end)
				v.get((i = j)).m = true;
		Top top = new Top();
		v.stream().filter(a->a.m).forEach(a->{
			while(top.v >= 2 && area(vv.get(top.v-2),vv.get(top.v-1),a) < 0) top.v --;
			vv.add(top.v++,a);				
		});
		IntStream.range(0, top.v).parallel().forEach(a->vv.get(a).h=true);
		for (int i = 1; i < n; i++) 			
			if(v.get(i-1).h && v.get(i-1).start == v.get(i).start && v.get(i-1).end == v.get(i).end)
				v.get(i).h= true;
		Collections.sort(v,(a,b)->a.index - b.index);
		v.stream().filter(a->a.h).forEach(a->out.print(a.index+" "));
		out.println();
		out.close();
	}
	public static long area(Line a, Line b, Line c){
		return (long) c.start * (a.start-b.start)*b.end*(a.end-c.end)
				-(long) b.start *(a.start-c.start)*c.end*(a.end-b.end);
	}
	
	public static class Line{
		int index,start,end;
		boolean m,h;
		public Line(int index, int start, int end){
			this.index= index; this.start = start; this.end = end;
		}
	}public static class Top{
		int v;
	}
	
	// -----------PrintWriter for faster output---------------------------------
	public static PrintWriter out = new PrintWriter(System.out);;

	// -----------MyScanner class for faster input----------
	public static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	// --------------------------------------------------------

}
