POJ 2785

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring> 
#include <set>
using namespace std;
const int MAXN = 4000+100;
typedef long long LL;

int n;
int A[MAXN],B[MAXN],C[MAXN],D[MAXN];
LL cnt,tmp;
multiset<int> set1,set2;

int main(){
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d %d %d %d",&(A[i]),&(B[i]),&(C[i]),&(D[i]));
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			set1.insert(A[i]+B[j]);
			set2.insert(C[i]+D[j]);
		}
	}
	for(set<int>::iterator it=set1.begin(); it!=set1.end(); it++){
		tmp = set2.count(*it*(-1));
		if( tmp>0 ){
			cnt+=tmp;
		}
	}
	cout << cnt << endl;
	return 0;
}