#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n], d[n], e[n];
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < n; i++)
cin >> b[i];
for(int i = 0; i < n; i++)
cin >> c[i];
for(int i = 0; i < n; i++)
cin >> d[i];
for(int i = 0; i < n; i++)
cin >> e[i];
unordered_map<int,int> mp;
for(int l = 0; l < n; l++){
for(int m = 0; m < n; m++){
mp[d[l]+e[m]]++;
}
}
int cnt = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
for(int k = 0; k < n; k++){
int sum = a[i]+b[j]+c[k];
int req = -1*sum;
if(mp.find(req) != mp.end()){
cnt += mp[req];
}
}
}
}
cout << cnt;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CglpbnQgYVtuXSwgYltuXSwgY1tuXSwgZFtuXSwgZVtuXTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gYVtpXTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gYltpXTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gY1tpXTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gZFtpXTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gZVtpXTsKCQoJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcDsKCWZvcihpbnQgbCA9IDA7IGwgPCBuOyBsKyspewoJCWZvcihpbnQgbSA9IDA7IG0gPCBuOyBtKyspewoJCQltcFtkW2xdK2VbbV1dKys7CgkJfQoJfQoJaW50IGNudCA9IDA7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQlmb3IoaW50IGogPSAwOyBqIDwgbjsgaisrKXsKCQkJZm9yKGludCBrID0gMDsgayA8IG47IGsrKyl7CgkJCQlpbnQgc3VtID0gYVtpXStiW2pdK2Nba107CgkJCQlpbnQgcmVxID0gLTEqc3VtOwoJCQkJaWYobXAuZmluZChyZXEpICE9IG1wLmVuZCgpKXsKCQkJCQljbnQgKz0gbXBbcmVxXTsKCQkJCX0KCQkJfQoJCX0KCX0KCWNvdXQgPDwgY250OwoJcmV0dXJuIDA7Cn0=