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