#include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>
using namespace std;
int main() {
vector<int> a {2, 3, 5, 7, 11, 13};
vector<int> b {1, 3, 5, 7, 9, 11};
unordered_set<int> s(a.begin(), a.end());
int res = count_if(b.begin(), b.end(), [&](int k) {return s.find(k) != s.end();});
cout << res << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8dW5vcmRlcmVkX3NldD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJdmVjdG9yPGludD4gYSB7MiwgMywgNSwgNywgMTEsIDEzfTsKCXZlY3RvcjxpbnQ+IGIgezEsIDMsIDUsIDcsIDksIDExfTsKCXVub3JkZXJlZF9zZXQ8aW50PiBzKGEuYmVnaW4oKSwgYS5lbmQoKSk7CglpbnQgcmVzID0gY291bnRfaWYoYi5iZWdpbigpLCBiLmVuZCgpLCBbJl0oaW50IGspIHtyZXR1cm4gcy5maW5kKGspICE9IHMuZW5kKCk7fSk7Cgljb3V0IDw8IHJlcyA8PCBlbmRsOwoJcmV0dXJuIDA7Cn0=