#include // #include // using namespace atcoder; // using mint = modint1000000007; // using mint = modint998244353; // using vmint = vc;using vvmint = vc; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define srep(i, s, n) for (int i = s; i < n; i++) #define drep(i, n) for (int i = n; i >= 0; i--) #define dsrep(i, s, n) for (int i = s; i >= n; i--) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() #define YES(n) cout << ((n) ? "YES" : "NO" ) << endl #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl using namespace std; template using vc = vector; template using vv = vc>; using vi = vc;using vvi = vv; using vvvi = vv>; using ll = long long;using vl = vc;using vvl = vv; using uint = unsigned int; using ull = unsigned long long; using pii = pair; const double pi = 3.141592653589793; const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; // const int mod = 1000000007; const int mod = 998244353; inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; } struct phash{ inline size_t operator()(const pair & p) const{ const auto h1 = hash()(p.first); const auto h2 = hash()(p.second); return h1 ^ (h2 << 1); } }; int main(){ string s; cin >> s; if (s[0] == s[1] && s[1] != s[2]) cout << "Yes" << endl; else cout << "No" << endl; }