#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n) - 1; i >= (a); i--)
#define fi first
#define se second

int n;
ll vz(pair<int,int> a, pair<int,int> b){
    return (((ll)(a.fi-b.fi))*(ll)(a.fi-b.fi)+((ll)(a.se-b.se))*(ll)(a.se-b.se));
}
pair<int,int> boda(pair<int,int> a, pair<int,int> b){
    return {a.fi-(b.se-a.se), a.se+(b.fi-a.fi)};
}
pair<int,int> bodb(pair<int,int> a, pair<int,int> b){
    return {b.fi-(b.se-a.se), b.se+(b.fi-a.fi)};
}
int main(void)
{
	ios_base::sync_with_stdio(false);
	cin >> n;
	vector<pair<int,int> > v;
	set<pair<int,int> > s;
	int i;
	for(i=0;i<4*n;i++){
        int a,b;
        cin >> a >> b;
        v.push_back({a,b});
        s.insert({a,b});
	}
	sort(v.begin(), v.end());
	ll res=0;
	int j=0;
	ll nejmensi;
	//cout << "a";
	while(!s.empty()){
        while(s.count(v[j])==0) j++;
        nejmensi=4000000000000000003;
        int kde=-1;
        for(int k=j+1;k<4*n;k++){
            while(k<4*n&&s.count(v[k])==0) k++;
            if(k==4*n) break;
            //cout << j << " " << k << " " << boda(v[j],v[k]).fi << " " << boda(v[j],v[k]).se << "     " << bodb(v[j],v[k]).fi <<" " << bodb(v[j],v[k]).se << endl;
            if(s.count(boda(v[j],v[k]))>0&&s.count(bodb(v[j],v[k]))>0){
                if(vz(v[j],v[k])<nejmensi) {nejmensi=vz(v[j],v[k]); kde=k;}
            }
        }
        //cout << kde << endl;
        res+=nejmensi;
        s.erase(v[j]);
        s.erase(v[kde]);
        s.erase(boda(v[j],v[kde]));
        s.erase(bodb(v[j],v[kde]));
	}
	cout << res << endl;
}