#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;
unordered_map<int,int>b;
for(int i=0;i<n;i++){
int x=k+a[i];
if(b.find(b[x])!=b.end()){
count++;
}
b[a[i]]++;
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYVtdPXs1LDYsNCwzLDZ9OwoJaW50IG49c2l6ZW9mKGEpL3NpemVvZihhWzBdKTsKCWludCBrPTM7CglpbnQgY291bnQ9MDsKCXVub3JkZXJlZF9tYXA8aW50LGludD5iOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJaW50IHg9aythW2ldOwoJCWlmKGIuZmluZChiW3hdKSE9Yi5lbmQoKSl7CgkJCWNvdW50Kys7CiAKCQl9CgkJYlthW2ldXSsrOwoJfQoJY291dDw8Y291bnQ7CiAKCXJldHVybiAwOwp9