B'Now that Heidi knows that she can assign Rebel spaceships to bases (recall the easy subtask), she is asking you: how exactly to do this? Now, given positions of N spaceships and N bases on a plane, your task is to connect spaceships and bases with line segments so that: The first line contains an integer N (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910000). For 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N, the i xe2 x80 x89+ xe2 x80 x891-th line contains two integers xi and yi (|xi|, xe2 x80 x89|yi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910000) denoting the coordinates of the i-th spaceship. The following N lines have the same format, denoting the position of bases. It is guaranteed that no two points coincide and no three points are on the same line. The output should have N lines. The i-th line should contain an integer pi, the index of the base to which the i-th spaceship is connected. The sequence p1, xe2 x80 x89..., xe2 x80 x89pN should form a permutation of 1, xe2 x80 x89..., xe2 x80 x89N. It is guaranteed that a solution exists. If there are multiple solutions, you can output any one of them. '...