#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 dp[(1<<17)][17];
bool viz[(1<<17)][17];
void rungame()
{
    if(n == pn)
    {
        g << pa << '\n';
        return;
    }
    memset(dp, 0, sizeof(dp));
    memset(viz, 0, sizeof(viz));
    for(int i = 0; i < n; ++i)
        viz[(1<<i)][i] = 1, dp[(1<<i)][i] = v[i].first * v[i].first + v[i].second * v[i].second;
    for(int i = 0; i < (1<<n); ++i)
    {
        vector<int>r;
        for(int j = 0; j < n; ++j)
            if(!(i & (1<<j)))
                r.push_back(j);
        for(int j = 0; j < n; ++j)
        {
            if(!viz[i][j])
                continue;
            for(int x = 0; x < r.size(); ++x)
            {
                int pp = r[x];
                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];
            }
        }
    }
    pn = n;
    pa = (1<<30);
    for(int i = 0; i < n; ++i)
        pa = min(pa, dp[(1<<n) - 1][i]);
    g << pa << '\n';
    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;
}