Problem: 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, ..., a_n form a permutation of 1, 2, ..., 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. 

Input

The first line contains an integer n (3 ≤ n ≤ 2000) — the number of points.

The i-th of the following n lines contains three integers x_i, y_i, a_i (-10^6 ≤ x_i, y_i ≤ 10^6, 1 ≤ a_i ≤ 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, ..., a_n form a permutation of 1, 2, ..., n.

Output

If it is impossible to perform a valid sequence of operations, print -1.

Otherwise, print an integer k (0 ≤ k ≤ (n(n - 1))/(2)) — the number of operations to perform, followed by k lines, each containing two integers i and j (1 ≤ i, j ≤ n, i≠ 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.

Examples

Input


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


Output


5
1 2
5 3
4 5
1 5
1 3


Input


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


Output


0

Note

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.

<image>

In the second test case, all labels are already in their correct positions, so no operations are necessary.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
	 
const int Maxn = 4005;
int n, ct, pos, a[Maxn], x[Maxn], y[Maxn], fa[Maxn], ord[Maxn];
pair <int, int> ans[Maxn];
int get_fa(int x)
{
	return x == fa[x] ? x : fa[x] = get_fa(fa[x]);
}
void merge(int x, int y)
{
	int a = get_fa(x), b = get_fa(y);
	fa[a] = b;
}
int main()
{
	scanf("%d", &n);
	x[0] = 0x3f3f3f3f;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d%d", &x[i], &y[i], &a[i]), fa[i] = i;
		if (a[i] != i && x[i] < x[pos]) pos = i;
	}
	if (!pos)
	{
		puts("0");
		return 0;
	}
	int tmpx = x[pos], tmpy = y[pos];
	for (int i = 1; i <= n; i++) x[i] -= tmpx, y[i] -= tmpy, ord[i] = i, merge(i, a[i]);
	sort(ord + 1, ord + 1 + n, [](int a, int b){if (a == pos) return true; if (b == pos) return false; return atan2(y[a], x[a]) < atan2(y[b], x[b]);});
	for (int i = 2; i <= n; i++)
	{
		int to = i == n ? 2 : i + 1;
		if (get_fa(ord[i]) != get_fa(ord[to])) ans[++ct] = make_pair(ord[i], ord[to]), merge(ord[i], ord[to]), swap(a[ord[i]], a[ord[to]]);
	}
	while (a[pos] != pos)
		ans[++ct] = make_pair(pos, a[pos]), swap(a[pos], a[a[pos]]);
	printf("%d\n", ct);
	for (int i = 1; i <= ct; i++)
		printf("%d %d\n", ans[i].first, ans[i].second);
	return 0;
}