A9771 | Tavas and Pashmaks

Tavas 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.

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}$ ).

In the first and the only line of output, print a sequence of numbers of possible winners in increasing order.