#include <iostream>
#include <iostream>
#include <map>
#include <set>
#include<algorithm>
#include <iterator>
using namespace std;
int main() {
set<string> candidatesSize2;
candidatesSize2.insert("b b");
candidatesSize2.insert("a b");
candidatesSize2.insert("b c");
candidatesSize2.insert("c b");
candidatesSize2.insert("bd");
candidatesSize2.insert("d b");
candidatesSize2.insert("b e");
candidatesSize2.insert("d c");
candidatesSize2.insert("ce");
const bool is_in = candidatesSize2.find("b b") != candidatesSize2.end();
if(is_in)
cout<<"true";
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxtYXA+CiNpbmNsdWRlIDxzZXQ+CiNpbmNsdWRlPGFsZ29yaXRobT4KI2luY2x1ZGUgPGl0ZXJhdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglzZXQ8c3RyaW5nPiBjYW5kaWRhdGVzU2l6ZTI7CgkJCQljYW5kaWRhdGVzU2l6ZTIuaW5zZXJ0KCJiIGIiKTsKCQkJCWNhbmRpZGF0ZXNTaXplMi5pbnNlcnQoImEgYiIpOwoJCQkJY2FuZGlkYXRlc1NpemUyLmluc2VydCgiYiBjIik7CgkJCQljYW5kaWRhdGVzU2l6ZTIuaW5zZXJ0KCJjIGIiKTsKCQkJCWNhbmRpZGF0ZXNTaXplMi5pbnNlcnQoImJkIik7CgkJCQljYW5kaWRhdGVzU2l6ZTIuaW5zZXJ0KCJkIGIiKTsKCQkJCWNhbmRpZGF0ZXNTaXplMi5pbnNlcnQoImIgZSIpOwoJCQkJY2FuZGlkYXRlc1NpemUyLmluc2VydCgiZCBjIik7CiAgICAgICAgICAgICAgICBjYW5kaWRhdGVzU2l6ZTIuaW5zZXJ0KCJjZSIpOwoJCgljb25zdCBib29sIGlzX2luID0gY2FuZGlkYXRlc1NpemUyLmZpbmQoImIgYiIpICE9IGNhbmRpZGF0ZXNTaXplMi5lbmQoKTsKCWlmKGlzX2luKQoJY291dDw8InRydWUiOwoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJcmV0dXJuIDA7Cn0=