POJ 2785

int main()
{
    int n;
    LL cnt=0;LL ans=0;
    LL temp;
    scanf("%d",&n);
    rep(i,n) scanf("%I64d%I64d%I64d%I64d",a+i,b+i,c+i,d+i);
    rep(i,n) rep(j,n)
    {
        e[cnt]=a[i]+b[j];
        f[cnt]=c[i]+d[j];
        cnt++;
    }
    sort(f,f+cnt);
    rep(i,cnt) ans+=(upper_bound(f,f+cnt,-e[i])-lower_bound(f,f+cnt,-e[i]));
    printf("%I64d\n",ans);
    return 0;
}