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.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;

public class CF535E {
	public static void main(String[] args) {
		run();
	}

	public static void run() {
		MyScanner sc = new MyScanner();
		PrintWriter out = new PrintWriter(System.out);
		int count = sc.nextInt();
		List<Pair<Integer,Integer>> v = new ArrayList<>(), w = new ArrayList<>();	
		Map<Pair<Integer,Integer>,Set<Integer>> q = new HashMap<CF535E.Pair<Integer,Integer>, Set<Integer>>();
		for(int i = 0; i<count; i++){
			Pair<Integer, Integer> p = new Pair<Integer, Integer>(sc.nextInt(), sc.nextInt());
			v.add(p);
			Set<Integer> s = new HashSet<>();
			s.add(i);
			q.put(p, s);
		}
		Collections.sort(v, (a,b)->a.first.equals(b.first)?a.second.compareTo(b.second):a.first.compareTo(b.first));
		for(int i = 0; i<v.size(); ++i){
			while(!w.isEmpty() && w.get(w.size()-1).second < v.get(i).second)
				w.remove(w.size()-1);
			w.add(v.get(i));
		}
		v.clear(); v.addAll(w); w.clear();
		for(int i = 0; i<(int)v.size(); ++i){
			while(w.size()>1 && check(intersect(w.get(w.size()-2),w.get(w.size()-1)),intersect(v.get(i),w.get(w.size()-1))))
				w.remove(w.size()-1);
			w.add(v.get(i));
		}
		Set<Integer> r = new HashSet<>();
		for(Pair<Integer,Integer> a : w)
			if(q.containsKey(a))
				r.addAll(q.get(a));
		List<Integer> results = new ArrayList<>(r);
		Collections.sort(results);
		for(Integer i : results)
			out.print((i+1)+" ");
		out.close();
	}

	private static boolean check(Pair<Integer, Integer> p1,
			Pair<Integer, Integer> p2) {
		return p1.first * p2.second >= p1.second * p2.first;
	}

	private static Pair<Integer, Integer>  intersect(Pair<Integer, Integer> p1,
			Pair<Integer, Integer> p2) {
		return new Pair<Integer, Integer>(p1.first*(p2.second-p1.second),p1.second*(p2.first-p1.first));
	}

	private static class Pair<V,W>{
		public V first;
		public W second;
		public Pair(V first, W second){
			this.first = first; this.second = second;
		}
	}
	
	// -----------PrintWriter for faster output---------------------------------
	public static PrintWriter 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;
		}
	}

	// --------------------------------------------------------
}
