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

塔瓦斯是新体育竞赛“帕什马克斯”（Pashmaks）中的一名啦啦队员。

该竞赛分为两个阶段：先游泳，再立即跑步。每位选手在恰好游完 $S$ 米后，立刻开始跑 $R$ 米。获胜者是指没有任何其他选手比其更早完成跑步的人（可能有多个获胜者）。

比赛开始前，塔瓦斯已知共有 $n$ 名选手报名参赛；他还知道第 $i$ 名选手的游泳速度为 $s_i$ 米/秒，跑步速度为 $r_i$ 米/秒。遗憾的是，他并不知道 $R$ 和 $S$ 的具体取值，但知道它们均为大于 $0$ 的实数。

作为一名啦啦队员，塔瓦斯想知道该为谁加油助威，因此他希望找出所有可能获胜的选手。我们称一名选手“可能获胜”，当且仅当存在某些 $R > 0$ 和 $S > 0$ 的取值，使得在该取值下，该选手成为获胜者。

塔瓦斯并不熟悉编程，因此请你帮他解决这个问题。

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 s__i and r__i (1 ≤ s__i, r__i ≤ 104).

输入的第一行包含一个整数 $n$（$1 \leq n \leq 2 \times 10^5$）。

接下来的 $n$ 行描述了参赛者的信息。第 $i$ 行包含两个整数 $s_i$ 和 $r_i$（$1 \leq s_i, r_i \leq 10^4$）。

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

在输出的第一行且唯一一行中，按升序打印可能获胜者的编号序列。