#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF= 1 << 28;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)
int dp[200][200];
int ct[200];
int cb[200];

int main(){
	int n;
	cin >> n;
	fill(&dp[0][0], &dp[199][199] + 1, INF);
	rep(i, n){
		cin >> ct[i] >> cb[i];
		dp[i][i] = 0;
	}
	rep2(w, 2, n + 1){
		rep(i, n){
			rep2(j, 1, w){
				dp[i][i+w-1] = min(dp[i][i+w-1],
					dp[i][i+j-1] + dp[i+j][i+w-1] + ct[i] * cb[i+j-1] * ct[i+j] * cb[i+w-1]);

			}
		}
	}
	cout << dp[0][n-1] << endl;
	return 0;
}