Swap Pass

给定平面上 $n$ 个点，第 $i$ 个点坐标为 $(x_i,y_i)$ 点权为 $a_i$，其中任意三点均不共线。 你可以执行以下操作若干次： - 选择两个不同的下标 $i,j$，交换 $a_i,a_j$，然后以点 $i$ 点 $j$ 为两端点画出一条线段。 要求最终形成的图中不存在相交线段（交于端点处不认为相交，相同线段认为相交），并且满足 $a_i=i$。 给出任意一种方案或者报告无解。

Based on a peculiar incident at basketball practice, Akari came up with the following competitive programming problem! You are given $ n $ points on the plane, no three of which are collinear. The $ i $ -th point initially has a label $ a_i $ , in such a way that the labels $ a_1, a_2, \dots, a_n $ form a permutation of $ 1, 2, \dots, n $ . You are allowed to modify the labels through the following operation: 1. Choose two distinct integers $ i $ and $ j $ between $ 1 $ and $ n $ . 2. Swap the labels of points $ i $ and $ j $ , and finally 3. Draw the segment between points $ i $ and $ j $ . A sequence of operations is valid if after applying all of the operations in the sequence in order, the $ k $ -th point ends up having the label $ k $ for all $ k $ between $ 1 $ and $ n $ inclusive, and the drawn segments don't intersect each other internally. Formally, if two of the segments intersect, then they must do so at a common endpoint of both segments. In particular, all drawn segments must be distinct. Find any valid sequence of operations, or say that none exist.

The first line contains an integer $ n $ ( $ 3 \le n \le 2000 $ ) — the number of points. The $ i $ -th of the following $ n $ lines contains three integers $ x_i $ , $ y_i $ , $ a_i $ ( $ -10^6 \le x_i, y_i \le 10^6 $ , $ 1 \le a_i \le n $ ), representing that the $ i $ -th point has coordinates $ (x_i, y_i) $ and initially has label $ a_i $ . It is guaranteed that all points are distinct, no three points are collinear, and the labels $ a_1, a_2, \dots, a_n $ form a permutation of $ 1, 2, \dots, n $ .

If it is impossible to perform a valid sequence of operations, print $ -1 $ . Otherwise, print an integer $ k $ ( $ 0 \le k \le \frac{n(n - 1)}{2} $ ) — the number of operations to perform, followed by $ k $ lines, each containing two integers $ i $ and $ j $ ( $ 1 \le i, j \le n $ , $ i\neq j $ ) — the indices of the points chosen for the operation. Note that you are not required to minimize or maximize the value of $ k $ . If there are multiple possible answers, you may print any of them.

5
-1 -2 2
3 0 5
1 3 4
4 -3 3
5 2 1

5
1 2
5 3
4 5
1 5
1 3

3
5 4 1
0 0 2
-3 -2 3

0

The following animation showcases the first sample test case. The black numbers represent the indices of the points, while the boxed orange numbers represent their labels.  In the second test case, all labels are already in their correct positions, so no operations are necessary.