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.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class runs {
	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		ArrayList<Trio> vel = new ArrayList<>(n);

		for (int i = 0; i < n; i++) {
			String[] line = br.readLine().split(" ");
			int v1 = Integer.parseInt(line[0]);
			int v2 = Integer.parseInt(line[1]);
			Trio aux = new Trio(v1, v2, i + 1);
			vel.add(aux);
		}

		Collections.sort(vel);

		System.err.println(vel.toString());

		ArrayList<Integer> ganadores = new ArrayList<>();
		Trio aux = vel.get(n - 1);
		int maxv1 = aux.v1;
		int maxv2 = aux.v2;
		ganadores.add(aux.i);

		for (int i = n - 2; i > -1; i--) {
			aux = vel.get(i);
			if (aux.v1 < maxv1) {
				if (aux.v2 > maxv2) {
					maxv1 = aux.v1;
					maxv2 = aux.v2;
					ganadores.add(aux.i);
				}
			}
		}

		Collections.sort(ganadores);

		for (int i = 0; i < ganadores.size(); i++) {
			System.out.print(ganadores.get(i) + " ");
		}
	}

	static class Trio implements Comparable<Trio> {
		public int v1;
		public int v2;
		public int i;

		public Trio(int v1, int v2, int i) {
			this.v1 = v1;
			this.v2 = v2;
			this.i = i;
		}

		@Override
		public int compareTo(Trio o2) {
			// TODO Auto-generated method stub
			if (this.v1 > o2.v1) {
				return 1;
			} else if (this.v1 == o2.v1) {
				if (this.v2 > o2.v2) {
					return 1;
				} else if (this.v2 == o2.v2) {
					return 0;
				} else {
					return -1;
				}
			} else {
				return -1;
			}
		}

		@Override
		public String toString() {
			String aux = "[";
			aux += this.v1 + ", " + this.v2 + ", " + this.i + "]";
			return aux;
		}
	}
}
