#include <bits/stdc++.h>
using namespace std;
int32_t mod = 1e9 + 7;
long long n, m, x, k, l, r;
bool f1, f2, f3;
string s, s1, s2;
vector<long long> v, v1, v2;
set<long long> se, se1, se2;
map<long long, long long> mp1, mp2;
void initiateCase() {
  n = m = x = k = l = r = 0;
  f1 = f2 = f3 = false;
  s = s1 = s2 = string();
  v = v1 = v2 = vector<long long>();
  se = se1 = se2 = set<long long>();
  mp1 = mp2 = map<long long, long long>();
}
void solveCase() {
  initiateCase();
  cin >> s;
  stack<char> sk;
  long long cnt = 0;
  for (long long i = 0; i < s.length(); i++) {
    if (sk.empty() || s[i] != sk.top())
      sk.push(s[i]);
    else {
      sk.pop();
      cnt++;
    }
  }
  cout << (cnt % 2 ? "Yes" : "No") << "\n";
}
int32_t main() { solveCase(); }
