#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>

using namespace std;

inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}

typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n-1)

const double EPS = 1e-10;

int main() {
	int n;
	cin >> n;

	vvi num(n+1, vi(2));
	vvi cost(n+1, vi(n+1, 1000000));

	REP(i, n) {
		cin >> num[i+1][0] >> num[i+1][1];
	}

	REP(i, n+1) {
		cost[1][i] = 0;
	}
	
	FOR(i, 2, n) {
		FOR(j, 1, n-i+1) {
			FOR(k, j, i+j-2) {
				int mul = num[j][0] * num[k][1] * num[k+1][0] * num[i+j-1][1];
				cost[i][j] = min(cost[i][j], mul+cost[k-j+1][j]+cost[i+j-k-1][k+1]);
			}
		}
	}

	cout << cost[n][1] << endl;
	return 0;
}