using namespace std;
#include<fstream>
#include<vector>
#define oo 0x3f3f3f3f
int cst[20][20];
int N;
int bst[(1<<17)+7][18];
int x[20], y[20];
vector<pair < pair<int, int>, int>  > pre;
ifstream f("bibel.in"); ofstream g("bibel.out");
int memo(int i, int j)
{
	if(bst[i][j] < oo) return bst[i][j];
	if( !(i & (1<<j))) return oo;
	int k;
	for(k=0; k < N; ++k)
		if(i &(1<<k))
			bst[i][j] = min(bst[i][j], memo(i - (1<<j), k) + cst[k][j]);
	return bst[i][j];
}
void solve()
{
	int i,j,k;
	for(i = 0; i < N; ++i)
		for(j = i+1; j < N; ++j)
			cst[i][j] = cst[j][i] = (x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]);
	for(i = 1; i < (1<<N); ++i)
		for(j = 0; j < N; ++j)
			bst[i][j] = oo;
	for(i = 0; i < N; ++i)
		for(j = 0; j < pre.size(); ++j)
			bst[1<<i][i] = min(bst[1<<i][i], pre[j].second + (pre[j].first.first - x[i]) *(pre[j].first.first - x[i]) + ( pre[j].first.second - y[i] ) * ( pre[j].first.second - y[i] ));
	
	for( i = 1; i < (1<<N); ++i)
	{
		for(j = 0; j < N; ++j)
			if(i & (1<<j))
				for( k = 0; k < N; ++k)
				{
					if( i & (1<<k)) continue;					
					bst[i | (1<<k) ][k] = min (bst[i | (1<<k)][k], bst[i][j] + cst[j][k]);
				}		
	}
	int sol = bst[(1<<N)-1][N-1];
	pre.clear();
	for(i = 0; i < N; ++i)
	{
		sol = min(sol, bst[(1<<N)-1][i]);
		pre.push_back(make_pair(make_pair(x[i],y[i]), bst[(1<<N)-1][i]));
	}
	g<<sol<<"\n";
}
int main()
{
	int op, i = 0;
	pre.push_back(make_pair(make_pair(0,0),0));
	while(true)
	{
		f>>op;
		if(op == 0)	f>>x[i]>>y[i++];
		else if(op == 1) { N = i; solve(); i = 0; }
		else if (op == 2) return 0;
	}
	return 0;
}