#include<bits/stdc++.h>
using namespace std;
ifstream f("bibel.in");
ofstream g("bibel.out");
pair<int, int> v[22];
int n, tip;
int pa, pn;
int dpp[17], ox[17], oy[17];
int dp[(1<<17) + 5][17];
bool viz[(1<<17) + 5][17];
void rungame()
{
    memset(dp, 0, sizeof(dp));
    memset(viz, 0, sizeof(viz));
    for(int i = 0; i < n; ++i)
    {
        dp[(1<<i)][i] = (1<<30);
        if(pn == 0)
            viz[(1<<i)][i] = 1, dp[(1<<i)][i] = v[i].first * v[i].first + v[i].second * v[i].second;
        else
            for(int j = 0; j < pn; ++j)
                viz[(1<<i)][i] = 1, dp[(1<<i)][i] = min(dp[(1<<i)][i], (ox[j] - v[i].first) * (ox[j] - v[i].first) + (oy[j] - v[i].second) * (oy[j] - v[i].second) + dpp[j]);
    }
    for(int i = 0; i < (1<<n); ++i)
        for(int j = 0; j < n; ++j)
        {
            if(!viz[i][j])
                continue;
            for(int pp = 0; pp < n; ++pp)
            {
                if(i & (1<<pp))
                    continue;
                int dd = (v[j].first - v[pp].first) * (v[j].first - v[pp].first) + (v[j].second - v[pp].second) * (v[j].second - v[pp].second);
                if(!viz[i + (1<<pp)][pp] || dd + dp[i][j] < dp[i + (1<<pp)][pp])
                    viz[i + (1<<pp)][pp] = 1, dp[i + (1<<pp)][pp] = dd + dp[i][j];
            }
        }
    pa = (1<<30);
    for(int i = 0; i < n; ++i)
        pa = min(pa, dp[(1<<n) - 1][i]), dpp[i] = dp[(1<<n) - 1][i], ox[i] = v[i].first, oy[i] = v[i].second;
    g << pa << '\n';
    pn = n;
    n = 0;
    return;
}
int main()
{
    while(f >> tip)
    {
        if(tip == 2)
            break;
        if(tip == 1)
            rungame();
        if(tip == 0)
        {
            f >> v[n].first >> v[n].second;
            ++n;
        }
    }
    return 0;
}