Reform
On a picturesque plane with a Cartesian coordinate system, there existed a very traditional country from ancient times. This country had N cities, numbered consecutively from 1 to N. Despite their size, these cities are considered as points on the plane due to the vastness of the plane. The coordinates of the i-th city are (X_i, Y_i), and each pair of cities has unique coordinates. No 3 cities are collinear.
Some pairs of cities are connected by bidirectional roads, each being a straight line segment between two cities. Each city has exactly 3 roads extending from it. No road connects a city to itself, and there is at most one road between any pair of cities.
This arrangement had been unchanged for ages until a liberal king ascended to power, bringing about significant changes. A decree was issued to reform the road network, requiring:
Each city must have exactly 2 roads extending from it.
The turning angle between the two roads from the same city must be strictly less than 60 degrees.
No two roads should intersect anywhere other than at the cities.
The turning angle between two roads is defined as follows: if roads from city B lead to cities A and C, the turning angle is the external angle at vertex B in triangle ABC (refer to the figure).
The task of implementing this reform was assigned to the Minister of Transport. He must decide which roads to remove and which to retain. To satisfy the king, the minister aims to choose a solution that minimizes the maximum turning angle between the two roads from any city.
Input
The first line of the input contains an integer N. Each of the following N lines contains 5 integers. The first two numbers on the i-th line are X_i and Y_i. The next three numbers are the indices of the cities initially connected to the i-th city by roads.
All numbers in the input are integers. 4 ≤ N ≤ 200, N is even, -10^5 ≤ X_i, Y_i ≤ 10^5.
No two cities share the same coordinates. No 3 cities are collinear.
Each city is connected by roads to exactly 3 other cities.
There is at most one road between any pair of cities. No road connects a city to itself. Any two turning angles (not necessarily at the same city) before the reform differ by at least 10^{-5} degrees.
Any turning angle before the reform differs from 60 degrees by at least 10^{-5} degrees.
Output
If it is impossible to meet the king's requirements, output a single line containing "Minister's life is short :(" (without quotes). The characters ’, :, and ( have ASCII codes 39, 58, and 40 respectively.
Otherwise, output the solution the minister should choose, as N integers separated by spaces. If the i-th number in the output is j, it indicates that the minister should remove the road between cities i and j.