#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  stack<char> p;
  int k = 0;
  for (int i = 0; i < s.length(); i++) {
    if (p.size() != 0) {
      if (p.top() == s[i]) {
        p.pop();
        k--;
      } else {
        p.push(s[i]);
        k++;
      }
    } else {
      p.push(s[i]);
      k++;
    }
  }
  int l = ((s.length()) - k) / 2;
  if (l % 2 == 0)
    cout << "No" << endl;
  else
    cout << "Yes" << endl;
  return 0;
}
