#include <bits/stdc++.h>
using namespace std;
const int maxn = 100003;
char s[maxn];
int n;
bool del[maxn];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  set<int> st;
  set<int>::iterator it1, it2, it3, it4;
  queue<pair<int, int> > q;
  for (int i = 1; i <= n; i++) {
    st.insert(i);
    if (s[i] == s[i + 1]) q.push(pair<int, int>(i, i + 1));
  }
  bool ok = 0;
  while (!q.empty()) {
    int u = q.front().first, v = q.front().second;
    q.pop();
    if (del[u] || del[v]) continue;
    ok ^= 1;
    del[u] = del[v] = 1;
    it2 = st.find(u), it3 = st.find(v);
    if (it2 != st.begin() && it3 != --st.end()) {
      --(it1 = it2), ++(it4 = it3);
      if (s[*it1] == s[*it4]) q.push(pair<int, int>(*it1, *it4));
    }
    st.erase(it2), st.erase(it3);
  }
  puts(ok ? "Yes" : "No");
  return 0;
}
