#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define INF (1<<29)

int dp[100][100];
int a[100], b[100];

int main() {
	int n;
	cin >> n;
	REP(i, n) scanf("%d %d", &a[i], &b[i]);
	
	fill(dp[0], dp[100], INF);
	REP(i, n) dp[i][i] = 0;
	FOR(w, 1, n) REP(i, n - w) FOR(j, i, i + w) {
		dp[i][i + w] = min(dp[i][i + w], dp[i][j] + dp[j + 1][i + w] + a[i] * b[j] * a[j + 1] * b[i + w]);
	}
	cout << dp[0][n - 1] << endl;
	return 0;
}