自闭儿童求助qwq

#include<bits/stdc++.h>
#define maxn 4010
using namespace std;

inline int read(){
	int x=0,t=1; char ch=getchar();
	while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
	if(ch=='-') t=-1,ch=getchar();
	while(ch<='9'&&ch>='0') x=x*10+ch-48,ch=getchar();
	return x*t;
}

int n,ans;
int a[maxn],b[maxn],c[maxn],d[maxn];
int a_b[maxn*maxn],cnt;
int c_d[maxn*maxn],cnt_now;

int main(){
	n=read();
	for(register int i=0;i<n;++i){
		scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
	}
	for(register int i=0;i<n;++i){
		for(register int j=0;j<n;++j){
			a_b[cnt]=a[i]+b[j];
			c_d[cnt]=-(c[i]+d[j]);
			cnt++;
		}
	}
	sort(a_b,a_b+n*n);
	for(register int i=0;i<cnt;++i){
		int l=0,r=n*n;
		while(l<r){
			int mid=(l+r)>>1;
			if(c_d[i]==a_b[mid]){ans++; break;}
			if(c_d[i]<a_b[mid]) l=mid+1;
			else r=mid;
		}
	}
	printf("%d",ans);
	return 0;
}