// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int dp[110][110], A[110], B[110];
 
signed main() {
    int N; cin >> N;
    fill(dp[0], dp[N+1], INF);
    for(int i=0; i<N; i++) {
        cin >> A[i] >> B[i];
        dp[i][i+1] = 0;
    }

    for(int d=1; d<=N; d++) {
        for(int l=0; l<N-d+1; l++) {
            int r = l + d;
            for(int k=l+1; k<r; k++) {
                int cost = A[l] * B[k-1] * A[k] * B[r-1];
                chmin(dp[l][r], dp[l][k] + dp[k][r] + cost);
            }
        }
    }
    cout << dp[0][N] << endl;
    return 0;
}
