Flight Collision

문제

The Icelandic Corporation for Parcel Circulation is the leading carrier for transporting goods between Iceland and the rest of the world. Their newest innovation is a drone link connecting to mainland Europe that has a number of drones travelling back and forth along a single route.

The drones are equipped with a sophisticated system that allows them to fly evasive manoeuvres whenever two drones come close to each other. Unfortunately, a software glitch has caused this system to break down and now all drones are flying along the route with no way of avoiding collisions between them.

For the purposes of this problem, the drones are considered as points moving along an infinite straight line with constant velocity. Whenever two drones are at the same location, they will collide, causing them to fall off their flight path and plummet into the Atlantic Ocean. The flight schedule of the drones is guaranteed to be such that at no point will there be three or more drones colliding at the same location.

You know the current position of each drone as well as their velocities. Your task is to assess the damage caused by the system failure by finding out which drones will continue flying indefinitely without crashing.

입력

The input consists of:

• One line with an integer $nn$ ($1\le n\le {10}^{5}1\; \backslash leq\; n\; \backslash leq\; 10^5$), the number of drones. The drones are numbered from $11$ to $nn$.
• $nn$ lines, the $ii$th of which contains two integers $x_{i}x\_i$ and $v_{i}v\_i$ ($-{10}^9\le x_i,v_i\le {10}^9-10^9\; \backslash leq\; x\_i,v\_i\; \backslash leq\; 10^9$), the current location and the velocity of the $ii$th drone along the infinite straight line.

The drones are given by increasing $xx$ coordinate and no two drones are currently in the same position, i.e. for each $ii$. You may assume that there will never be a collision involving three or more drones.

출력

Output the number of drones that never crash, followed by the indices of these drones in numerically increasing order.

3
10 15
30 5
50 -1

1
3

6
0 3
2 2
3 1
4 3
5 2
6 3

2
1 6