#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

#define Nmax 17
#define INF 0x3f3f3f3f

using namespace std;

vector<pair<int,int> > pzant,crt;
vector<int> cant;

int DP[1<<Nmax][Nmax];
int Cost[Nmax][Nmax];
int N,lim;

int dist(pair<int,int> P1,pair<int,int> P2)
{
    return (P1.first - P2.first)*(P1.first - P2.first) +
           (P1.second - P2.second)*(P1.second - P2.second);
}

void Solve()
{
    N = crt.size();
    lim = (1<<N) - 1;

    for(int i = 0; i < N; ++i)
        for(int j = 0; j < N; ++j)
            Cost[i][j] = dist(crt[i],crt[j]);

    for(int i = 0; i <= lim; ++i)
        for(int j = 0; j < N; ++j)
            DP[i][j] = INF;

    for(int i = 0; i < pzant.size(); ++i)
        for(int j = 0; j < N; ++j)
            DP[1<<j][j] = min(DP[1<<j][j], cant[i] + dist(pzant[i],crt[j]));

    for(int MASK = 0; MASK <= lim; ++MASK)
        for(int i = 0; i < N; ++i)
            if(MASK & (1<<i)) /// exista nodul i
                for(int j = 0; j < N; ++j)
                    if(i != j) /// nu scot acelasi nod
                        if(MASK & (1<<j)) /// exista nodul de unde vreau sa vin
                            if(DP[MASK][i] > DP[MASK ^ (1<<i)][j] + Cost[j][i])
                                DP[MASK][i] = DP[MASK ^ (1<<i)][j] + Cost[j][i];
    int best = INF;

    cant.clear();
    pzant.clear();
    crt.clear();

    for(int i = 0; i < N; ++i)
    {
        if(best > DP[lim][i])
            best = DP[lim][i];
        pzant.push_back(crt[i]);
        cant.push_back(DP[lim][i]);
    }

    printf("%d\n",best);
}

int main()
{
    freopen("bibel.in","r",stdin);
    freopen("bibel.out","w",stdout);

    pzant.push_back(make_pair(0,0));
    cant.push_back(0);
    int op,x,y;
    for(scanf("%d",&op); op != 2; scanf("%d",&op))
    {
        if(op)
            Solve();
        else
        {
            scanf("%d%d",&x,&y);
            crt.push_back(make_pair(x,y));
        }
    }

    return 0;
}