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;


public class Cheer
{
	public static void main(final String args[])
	{
		try
		{
			start();
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
	}
	
	private static void start() throws IOException, NumberFormatException
	{
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		int cases = Integer.parseInt(reader.readLine());
		
		int[][] arr = new int[cases][2];
		int[] swimArr = new int[10002];
		int[] runArr = new int[10002];
		int bestSwim = 0;
		int bestRun = 0;
		
		for (int i = 0; i < cases; ++i)
		{
			String[] parts = reader.readLine().split(" ");
			int swim = Integer.parseInt(parts[0]);
			int run = Integer.parseInt(parts[1]);
			
			arr[i][0] = swim;
			arr[i][1] = run;
			bestSwim = Math.max(bestSwim, swim);
			bestRun = Math.max(bestRun, run);
			
			swimArr[swim] = Math.max(swimArr[swim], run);
			runArr[run] = Math.max(runArr[run], swim);
		}
		
		int count = 0;
		
		for (int i = 0; i < cases; ++i)
		{
			int swim = arr[i][0];
			int run = arr[i][1];
			
			if (swim == bestSwim || run == bestRun)
			{
				count++;
				continue;
			}
			
			if (swimArr[swim] > run) continue;
			if (runArr[run] > swim) continue;
			
			boolean skip = false;
			for (int j = swim+1; j < swimArr.length; ++j)
			{
				if (swimArr[j] >= run)
				{
					skip = true;
					break;
				}
			}
			if (skip) continue;
			
			for (int j = run+1; j < runArr.length; ++j)
			{
				if (runArr[j] >= swim)
				{
					skip = true;
					break;
				}
			}
			if (skip) continue;
			
			count++;
		}
		
		System.out.println("" + count);
	}
}
