No tag edit access

E. Tavas and Pashmaks

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTavas is a cheerleader in the new sports competition named "Pashmaks".

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 *s* _{ i} meters per second and his/her running speed is *r* _{ i} 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 × 10^{5}).

The next *n* lines contain the details of competitors. *i*-th line contains two integers *s* _{ i} and *r* _{ i} (1 ≤ *s* _{ i}, *r* _{ i} ≤ 10^{4}).

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

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2020 23:21:53 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|