#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> numbers(n);
for(int i=0; i<n; i++){
cin>>numbers[i];
}
int answer = 0;
unordered_map<int,int> modFreq;
for(int i=0; i<n; i++){
if(modFreq.find((5 - numbers[i]%5)%5) != modFreq.end()){
answer += modFreq[(5 - numbers[i]%5)%5];
}
modFreq[numbers[i]%5]++;
}
cout<<answer;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luPj5uOwoJCgl2ZWN0b3I8aW50PiBudW1iZXJzKG4pOwoJCglmb3IoaW50IGk9MDsgaTxuOyBpKyspewoJCWNpbj4+bnVtYmVyc1tpXTsKCX0KCQoJaW50IGFuc3dlciA9IDA7CgkKCXVub3JkZXJlZF9tYXA8aW50LGludD4gbW9kRnJlcTsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKCQlpZihtb2RGcmVxLmZpbmQoKDUgLSBudW1iZXJzW2ldJTUpJTUpICE9IG1vZEZyZXEuZW5kKCkpewoJCQlhbnN3ZXIgKz0gbW9kRnJlcVsoNSAtIG51bWJlcnNbaV0lNSklNV07CgkJfQoJCQoJCW1vZEZyZXFbbnVtYmVyc1tpXSU1XSsrOwoJfQoJCgljb3V0PDxhbnN3ZXI7CgkKCXJldHVybiAwOwp9