#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int a[110],b[110];
Int dp[110][110];

Int f(int n,int m){
	if(dp[n][m]!=0)return dp[n][m];
	if(n==m)return 0;
	int i;
	Int mn=1000000000000LL;
	for(i=n;i<m;i++){
		chmin(mn,f(n,i)+f(i+1,m)+a[n]*b[i]*a[i+1]*b[m]);
	}
	dp[n][m]=mn;
	return mn;
}

int main() {
	int n,i;
	cin>>n;
	for(i=0;i<n;i++){
		cin>>a[i]>>b[i];
	}
	cout<<f(0,n-1)<<endl;
	return 0;
}