Who visits early in the morning#1895
In Rudolandia, a magical land, there are unique foxes, each living in their own house. Following an ancient tradition, every fox considers it necessary to wake up early, freshen up, get dressed, and go to visit someone. Naturally, to act not just wisely, but very wisely and to minimize travel time, each fox will visit their nearest neighbor—the fox whose house is closest to their own. It is clear that the owner of this house will not be at home, since they will also be following the ancient tradition. Consequently, there will be no one to shout "Hooray!" or greet the guests. If multiple houses are at the same minimal distance from a fox, they will choose to visit the house with the smallest number. Your task is to determine which foxes will gather at each house.
The first line contains the number of foxes (2 \leq N \leq 100000). Each of the next lines contains two integers, the coordinates of the point on the plane where each fox's house is located. All coordinates are non-negative integers and do not exceed 10^9.
Output lines. The -th line should contain the number , followed by a colon, and then, in ascending order, the numbers of the foxes who will come to visit the -th house.
Example 1