#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {2,2,5,5,3,3};
int n=sizeof(arr)/sizeof(arr[0]);
int pairs=0;
unordered_map<int, int> mp;
for(int j=0;j<n;j++){
int rem=arr[j]%5;
if(mp.find((5-rem)%5)!=mp.end()){
pairs+=mp[(5-rem)%5];
}
mp[rem]++;
}
cout<<pairs;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezIsMiw1LDUsMywzfTsKCWludCBuPXNpemVvZihhcnIpL3NpemVvZihhcnJbMF0pOwoJaW50IHBhaXJzPTA7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcDsKCWZvcihpbnQgaj0wO2o8bjtqKyspewoJCWludCByZW09YXJyW2pdJTU7CgkJaWYobXAuZmluZCgoNS1yZW0pJTUpIT1tcC5lbmQoKSl7CgkJCXBhaXJzKz1tcFsoNS1yZW0pJTVdOwoJCX0KCQltcFtyZW1dKys7Cgl9Cgljb3V0PDxwYWlyczsKCXJldHVybiAwOwp9Cg==