#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {3,1,2,3,2};
int n=sizeof(arr)/sizeof(arr[0]);
int k=2;
bool flag=false;
unordered_map<int, int> mp;
for(int i=0;i<n;i++){
if(mp.find(arr[i])!=mp.end()){
int index=mp[arr[i]];
if(i-index<=k){
flag=true;
break;
}
}
mp[arr[i]]=i;
}
if(flag)
cout<<"yes";
else
cout<<"no";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezMsMSwyLDMsMn07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCWludCBrPTI7Cglib29sIGZsYWc9ZmFsc2U7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWlmKG1wLmZpbmQoYXJyW2ldKSE9bXAuZW5kKCkpewoJCQlpbnQgaW5kZXg9bXBbYXJyW2ldXTsKCQkJaWYoaS1pbmRleDw9ayl7CgkJCQlmbGFnPXRydWU7CgkJCQlicmVhazsKCQkJfQoJCX0KCQltcFthcnJbaV1dPWk7Cgl9CglpZihmbGFnKQoJCWNvdXQ8PCJ5ZXMiOwoJZWxzZQoJCWNvdXQ8PCJubyI7CglyZXR1cm4gMDsKfQoK