#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
using namespace std;
struct vertex
{
int x;
int y;
};
void input(vector<vertex>& p)
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
vertex v;
cin >> v.x >> v.y;
p.push_back(v);
}
}
long long cost(vertex v, vertex u, int diff)
{
if (diff == 1) return 0;
return ((v.x - u.x) * (v.x - u.x) + (v.y - u.y) * (v.y - u.y));
}
long long findingDiagonals(vector<vertex>& p, vector<vector<int>>& d, vector<vector<long long>>& r, int left, int right)
{
if (r[left][right] != -1)
return r[left][right];
if (left - right == 1)
return 0;
long long x = numeric_limits<long long>::max();
int v = -1;
for (int k = left + 1; k < right; k++)
{
long long n;
n = cost(p[left], p[k], k - left) + cost(p[k], p[right], right - k) + findingDiagonals(p, d, r, left, k) + findingDiagonals(p, d, r, k, right);
cout << left << " " << k << " " << right << " " << n << endl;
if (n < x)
{
x = n;
v = k;
}
}
d[left][right] = v;
r[left][right] = x;
if(x == numeric_limits<long long>::max()) return 0;
return x;
}
void choosingDiagonals(vector<vertex>& p, vector<vector<int>>& d, vector<vertex>& uD, int left, int right)
{
if (left - right == 1)
return;
vertex x;
x.x = left;
x.y = right;
uD.push_back(x);
choosingDiagonals(p, d, uD, left, d[left][right]);
choosingDiagonals(p, d, uD, d[left][right], right);
}
long long length(vector<vertex>& uD, vector<vector<long long>>& r)
{
long long result = 0;
for (auto i = uD.begin(); i != uD.end(); i++)
result += r[(*i).x][(*i).y];
return result;
}
void output(vector<vertex>& uD, long long r)
{
cout << r << " ";
for (auto i = uD.begin(); i != uD.end(); i++)
cout << (*i).x << " " << (*i).y << " ";
cout << "\n";
}
int main()
{
ios_base::sync_with_stdio(0);
int z;
cin >> z;
while (z--)
{
vector<vertex> polygon;
vector<vertex> usedDiagonals;
vector<vector<int>> diagonals;
vector<vector<long long>> results;
long long result;
input(polygon);
diagonals.assign(polygon.size(), vector<int>(polygon.size(), -1));
results.assign(polygon.size(), vector<long long>(polygon.size(), -1));
if (polygon.size() > 3)
{
findingDiagonals(polygon, diagonals, results, 0, polygon.size() - 1);
choosingDiagonals(polygon, diagonals, usedDiagonals, 0, diagonals[0][polygon.size() - 1]);
choosingDiagonals(polygon, diagonals, usedDiagonals, diagonals[0][polygon.size() - 1], polygon.size() - 1);
}
result = length(usedDiagonals, results);
output(usedDiagonals, result);
}
return 0;
}