Run and Swim Race

An algorithm camp holds a two event race. The race has a running leg and a swimming leg. Every participant runs $R$ meters first, then swims $S$ meters. The person who reaches the finish line first wins. If several people reach the finish line at the same moment, all of them are co-winners.

Before the race starts, Seonggwan looks at the records of the $N$ participants. Participant $i$ runs at $r_i$ meters per second and swims at $s_i$ meters per second, so participant $i$ reaches the finish line at time $\frac{R}{r_i} + \frac{S}{s_i}$ seconds.

Seonggwan knows both speeds of every participant, but he does not know $R$ and $S$. He only knows that $R$ and $S$ are real numbers greater than 0. The winner changes with the choice of $R$ and $S$, so he wants to know who can win. Participant $i$ can win if there are real numbers $R > 0$ and $S > 0$ that make participant $i$ a winner or a co-winner. Write a program that finds every participant who can win.

The first line contains the number of participants $N$. ($1 \le N \le 200000$)

Each of the next $N$ lines describes one participant. Line $i$ contains the swimming speed $s_i$ and then the running speed $r_i$ of participant $i$. Note that the swimming speed comes first. Both values are positive integers. ($1 \le s_i, r_i \le 10000$)

Print the numbers of all participants who can win, in increasing order, on one line. Separate the numbers with a single space.