#include <cstdio>
#include <vector>

using namespace std;

vector< pair<int, int> > cur;
vector< vector< pair<int, int> >  > game;

#define MAXB 17

char seen[ 1 << MAXB ][MAXB];

unsigned bst[ 1 << MAXB ][MAXB];
unsigned last[MAXB];

unsigned curDist[MAXB][MAXB];

inline unsigned sqr( int x ) { return (unsigned)x * x; }

inline unsigned dist( const pair<int, int> &a, const pair<int, int> &b )
{
	return sqr(a.first - b.first) + sqr(a.second - b.second);
}

inline unsigned solve( int st, int l, int g )
{
	if (seen[st][l])
		return bst[st][l];
	bst[st][l] = 0xffffffff;
	seen[st][l] = 1;

	for (size_t a = 0; a < game[g].size(); a++)
	{
		if ( !(st & (1 << a)) || ((int)a == l) ) continue;
		unsigned newbst = solve( st ^ (1 << l), a, g ) + curDist[a][l];
		if (newbst < bst[st][l])
			bst[st][l] = newbst;
	}

	return bst[st][l];
}

int main()
{
	freopen("bibel.in", "rt", stdin);
	freopen("bibel.out", "wt", stdout);

	game.clear(); cur.clear();
	for (; 1; )
	{
		int type;
		scanf("%d", &type);
		if (type == 2)
			break;
		if (type == 1)
			game.push_back( cur ),
			cur.clear();

		if (type == 0)
		{
			int X, Y;
			scanf("%d %d", &X, &Y);
			cur.push_back( make_pair(X, Y) );
		}
	}

	memset(seen, 0, sizeof(seen));
	for (size_t a = 0; a < game[0].size(); a++)
	{
		seen[ 1 << a ][a] = 1;
		bst[ 1 << a ][a] = dist( make_pair(0, 0), game[0][a] );
	}

	for (size_t k = 0; k < game.size(); k++)
	{
		for (size_t a = 0; a < game[k].size(); a++)
			for (size_t b = 0; b < game[k].size(); b++)
				curDist[a][b] = dist( game[k][a], game[k][b] );

		unsigned MIN = 0xffffffff;
		for (size_t a = 0; a < game[k].size(); a++)
		{
			last[a] = solve( (1 << game[k].size()) - 1, a, k );
			if (last[a] < MIN)
				MIN = last[a];
		}
		printf("%u\n", MIN);

		memset( seen, 0, sizeof(seen) );
		if (k + 1 < game.size())
			for (size_t a = 0; a < game[k + 1].size(); a++)
			{
				unsigned MIN = 0xffffffff;
				for (size_t b = 0; b < game[k].size(); b++)
				{
					unsigned val = last[b] + dist( game[k][b], game[k + 1][a] );
					if (val < MIN)
						MIN = val;
				}
				bst[ (1 << a) ][a] = MIN;
				seen[ (1 << a) ][a] = 1;
			}
	}

	return 0;
}