#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {1, 5, 3, 4, 2};
int n=sizeof(arr)/sizeof(arr[0]);
int diff=2;
int count=0;
unordered_map<int, int> st;
for(int j=0;j<n;j++){
if(st.find(diff+arr[j])!=st.end())
count=count+st[diff+arr[j]];
st[arr[j]]++;
}
cout<<count;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezEsIDUsIDMsIDQsIDJ9OwoJaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CglpbnQgZGlmZj0yOwoJaW50IGNvdW50PTA7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBzdDsKCWZvcihpbnQgaj0wO2o8bjtqKyspewoJCWlmKHN0LmZpbmQoZGlmZithcnJbal0pIT1zdC5lbmQoKSkKCQkJY291bnQ9Y291bnQrc3RbZGlmZithcnJbal1dOwoJCXN0W2FycltqXV0rKzsKCX0KCWNvdXQ8PGNvdW50Owp9Cg==