Drone Elimination

Ralph escaped from his game, so $n$ specially trained drones were sent to find him. Ralph is not easy to catch, though, and he has set up a defensive position with a turret in his hands.

After studying the situation, Ralph worked out that on a plane with him at the origin $(0, 0)$, drone $i$ is at the point $(x_i, y_i)$. While Ralph was scouting, the drones spotted him, so he has to act now. Each second, Ralph can shoot any one drone with his turret. After each shot, every surviving drone can move to any of the 8 points adjacent to it horizontally, vertically, or diagonally. Several drones may end up at the same coordinates.

The drones want to reach Ralph at $(0, 0)$, and Ralph wants to destroy all of them before they reach him. Ralph guarantees that he never misses and that each shot destroys exactly one drone. Tell him the order in which to shoot the drones so that none of them reaches $(0, 0)$. If that is impossible, say so, and Ralph should run.

The first line contains the number of drones $n$ ($1 \le n \le 10^5$). Each of the next $n$ lines contains two integers $x_i$ and $y_i$, the coordinates of drone $i$ ($|x_i|, |y_i| \le 10^5$). It is guaranteed that no drone is at $(0, 0)$.

Print $n$ integers from 1 to $n$ on a single line, separated by spaces. These are the numbers of the drones in the order Ralph should shoot them. If some drone reaches $(0, 0)$ no matter what, print "-1" on a single line. If several solutions exist, you may print any of them.