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