#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
const double PI = 3.142857142857;
using namespace std;
long long arr[1000000];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string x;
  cin >> x;
  bool ok = 0;
  int fr = 0, sc = 0;
  for (int i = 0; i < ((int)(x).size()) - 1; i++) {
    if (x[i] == x[i + 1]) {
      if (ok == 0) {
        fr++;
        ok = 1;
        x.erase(i, 2);
      } else if (ok) {
        ok = 0;
        sc++;
        x.erase(i, 2);
      }
      i = -1;
    }
  }
  if (fr > sc)
    cout << "Yes";
  else
    cout << "No";
}
