#include <bits/stdc++.h>
#define cin ci
#define cout co
#define ll long long
using namespace std;
ifstream cin("bibel.in");
ofstream cout("bibel.out");
const int Nmax = 18;
const int INF = 1e9;
int q, x, y, n;
vector<vector<int>> dp;
vector<pair<int, int>> pct, last;
vector<int> niv;
int first = 1;
int dist(pair<int, int> a, pair<int, int> b)
{
    return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}
void solve()
{
    int k = pct.size();
    dp.assign((1 << k), vector<int>(k, INF));
    niv.resize(pct.size());

    if(first)
    {
        for(int i=0; i<(int)pct.size(); i++)
            dp[(1 << i)][i] = dist(pct[i], {0, 0});
    }
    else
    {
        for(int i=0; i<(int)pct.size(); i++)
            for(int j=0; j<(int)last.size(); j++)
            {
                int val = niv[j] + dist(pct[i], last[j]);
                dp[1 << i][ i ] = min( dp[1 << i][ i ],  val);
            }

    }

    for(int mask = 1; mask < (1 << (int)pct.size()); mask++)
        for(int i=0; i<(int)pct.size(); i++)
            if(mask & (1 << i))
                for(int j=0; j<(int)pct.size(); j++)
                    if(mask & (1 << j))
                        dp[mask][i] = min(dp[mask][i] , dp[mask ^ (1 << i)][j] + dist(pct[i], pct[j]));
    last.clear();
    for(auto i : pct)
        last.push_back(i);

    for(int i=0; i<(int)pct.size(); i++)
        niv[i] = dp[(1 << pct.size()) - 1][i];

    int ans = INF;
    for(int i=0; i<(int)pct.size(); i++)
        ans = min(ans, dp[(1 << pct.size()) - 1][i]);
    cout << ans << '\n';
    pct.clear();
}
int32_t main()
{
    dp.assign((1 << Nmax), vector<int>(Nmax + 1, INF));
    while(1)
    {
        cin >> q;
        if(q == 1)
        {
            solve();
            first = 0;
        }
        else if(!q)
        {
            cin >> x >> y;
            pct.push_back({x, y});
        }
        else
            break;
    }
    return 0;
}