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

public class CF535E {
	static Competitor origin = new Competitor(-1, 0, 0);
	static class Competitor implements Comparable<Competitor>{
		
		int swimmingSpeed, runningSpeed, index;
		
		public Competitor(int index, int swimmingSpeed, int runningSpeed){
			this.index = index;
			this.swimmingSpeed = swimmingSpeed;
			this.runningSpeed = runningSpeed;
		}
		
		@Override
		public String toString() {
			return index+ ":"+ swimmingSpeed+","+runningSpeed;
		}
		
		static Comparator<Competitor> indexCmp = new Comparator<CF535E.Competitor>() {
			@Override
			public int compare(Competitor o1, Competitor o2) {
				return (o1.index - o2.index);
			}
		};
		
		@Override
		public int compareTo(Competitor q) {
			int cross = (int)crossProduct(origin, this, q);
			return cross; 
		}
		
		static Comparator<Competitor> swimmingRuningCmp = new Comparator<CF535E.Competitor>() {
			/**
			 * Returns a negative integer, zero, or a positive integer as the second argument is less than, equal to, or greater than the first.
			 */
			@Override
			public int compare(Competitor o1, Competitor o2) {
				if (o2.swimmingSpeed == o1.swimmingSpeed)
					return (o2.runningSpeed - o1.runningSpeed);
				return (o2.swimmingSpeed - o1.swimmingSpeed);
			}
		};
	}
	
	public static void main( String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine().toString());
		Competitor[] competitors = new Competitor[n]; 
		for (int i = 0; i < n; i++) {
			String[] str = br.readLine().split(" ");
			competitors[i] = new Competitor(i+1, Integer.parseInt(str[0]), Integer.parseInt(str[1]));
		}
		Arrays.sort(competitors,Competitor.swimmingRuningCmp);
//		printComp(competitors);
		ArrayList<Competitor> winners = new ArrayList<CF535E.Competitor>();
		winners.add(competitors[0]);
		for (int i = 1; i < competitors.length; i++) {
			if(competitors[i].swimmingSpeed < winners.get(winners.size()-1).swimmingSpeed && 
					competitors[i].runningSpeed > winners.get(winners.size()-1).runningSpeed)
				winners.add(competitors[i]);
		}
		Competitor [] compOnConvexHull = getConvexHullBoundaries(winners);
//		printComp(compOnConvexHull);
		
		Collections.sort(winners, Competitor.indexCmp);
		for (Competitor competitor : winners) {
			System.out.print(competitor.index+" ");
		}
	}

	private static int getFastestswimmer(Competitor[] competitors) {
		int index = 0;
		for (int i = 1; i < competitors.length; i++) {
			if(competitors[index].swimmingSpeed < competitors[i].swimmingSpeed ){
				index = i;
			}
		}
		return index;
	}

	private static void printComp(Competitor[] CompOnConvexHull) {
		for (Competitor competitor : CompOnConvexHull) {
			System.out.print(competitor+"\t");
		}
		System.out.println();
	}
	
	private static int getFastestRunner(Competitor[] competitors) {
		int index = 0;
		for (int i = 1; i < competitors.length; i++) {
			if(competitors[index].runningSpeed < competitors[i].runningSpeed ){
				index = i;
			}
		}
		return index;
	}

	private static Competitor[] getConvexHullBoundaries(ArrayList<Competitor> competitors) {
		Competitor[] convexHull = new Competitor[competitors.size()];
		convexHull[0] = competitors.get(0);
		convexHull[1] = competitors.get(1);
		int size = 2;
		for (int i = 2; i < competitors.size(); i++) {
			while(size>=2 && crossProduct(convexHull[size-2], convexHull[size-1], competitors.get(i))<0){
				size--;
			}
			convexHull[size++] =  competitors.get(i);
		}
		return Arrays.copyOfRange(convexHull, 0, size); 
	}
	
	private static long crossProduct(Competitor p1, Competitor p2, Competitor p3) {
		return  (long)p3.swimmingSpeed * (long)(p1.swimmingSpeed - p2.swimmingSpeed) * (long)p2.runningSpeed * (long)(p1.runningSpeed - p3.runningSpeed)
				- (long)p2.swimmingSpeed * (long)(p1.swimmingSpeed - p3.swimmingSpeed) * (long)p3.runningSpeed * (long)(p1.runningSpeed - p2.runningSpeed);
	}

}
