#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct M{ ll a, b; };


int main()
{
    int n;
	cin >> n;
	
	vector<M> v(n);
	vector<vector<ll> > dp(n, vector<ll>(n, 1 << 30LL));
	
	rep(i, n) cin >> v[i].a >> v[i].b;
	rep(i, n) dp[i][i] = 0;
	
	REP(i, 1, n) rep(j, n - i) rep(k, i + j) 
	{
		chmin(dp[j][i + j], dp[j][k] + dp[k + 1][i + j] + v[j].a * v[k].b * v[k + 1].a * v[i + j].b);
	}
	
	cout << dp[0][n - 1] << endl;
}