Justice Rains from Above!

Given each robot's coordinates and missile speed, output the robot indices sorted by hit time (distance divided by speed), breaking ties by smaller index.

Medium4SortingMathGeometryInterviewNo attempts yetTime limit1sMemory limit128 MB

Problem

Gyuhyun draws the fight in his head as a coordinate plane. The character he plays stands at the origin (0,0)(0, 0), and its ultimate fires a missile in a straight line at every enemy robot at the same moment. Each missile has its own speed, so a far robot is sometimes hit before a near one.

If robot ii is at (Xi,Yi)(X_i, Y_i) and the missile flying toward it has speed ViV_i, that robot is shot down at time Xi2+Yi2Vi\frac{\sqrt{X_i^2 + Y_i^2}}{V_i}. Write a program that finds the order in which the robots are shot down.

Input

The first line contains the number of robots NN. (1N1000001 \le N \le 100\,000)

Each of the next NN lines contains XiX_i, YiY_i and ViV_i, separated by spaces. XiX_i and YiY_i are the coordinates of robot ii, and ViV_i is the speed of the missile flying toward that robot. (Xi10000|X_i| \le 10\,000, Yi10000|Y_i| \le 10\,000, 0<Vi10000 < V_i \le 1\,000)

The robots are numbered 1 to NN in the order they appear in the input. No two robots share the same coordinates.

Output

Print the numbers of the robots in the order they are shot down, one per line. If two robots are shot down at the same time, print the smaller number first.