#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a[]={5,6,4,3,6};
int n=sizeof(a)/sizeof(a[0]);
int k=3;
int count=0;
int x=0;
unordered_map<int,int>b;
for(int i=0;i<n;i++){
x=k+a[i];
if(b.find(x)!=b.end()){
count+=b[x];
}
b[a[i]]++;
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYVtdPXs1LDYsNCwzLDZ9OwoJaW50IG49c2l6ZW9mKGEpL3NpemVvZihhWzBdKTsKCWludCBrPTM7CglpbnQgY291bnQ9MDsKCWludCB4PTA7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+YjsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCXg9aythW2ldOwoJCWlmKGIuZmluZCh4KSE9Yi5lbmQoKSl7CgkJCWNvdW50Kz1iW3hdOwogCgkJfQoJCWJbYVtpXV0rKzsKCX0KCWNvdXQ8PGNvdW50OwogCglyZXR1cm4gMDsKfQ==