#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<long long, long long>,
                       vector<pair<long long, long long> >,
                       greater<pair<long long, long long> > >
    minheap;
void input(long long *arr, long long n) {
  for (int i = 0; i < n; ++i) cin >> arr[i];
}
void swap(long long &x, long long &y) { x = x ^ y ^ (y = x ^ y ^ y); }
long long gcd(long long a, long long b) {
  if (!a) return b;
  return gcd(b % a, a);
}
long long power(long long x, long long k) {
  long long ans = 1;
  while (k) {
    if (k % 2) ans = (ans * x) % 1000000007;
    k /= 2;
    x = (x * x) % 1000000007;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 0, n, m, l, k, i, j = -1, cnt = 0, ans = 0, tmp = 0, diff = 0,
            size, mx = -1, mn = INT_MAX;
  long long sel = 0, x, d = 0;
  pair<long long, long long> nd;
  char ch;
  vector<long long> a, b;
  map<char, long long> mp, mpx;
  string s, in, tm;
  cin >> s;
  n = s.size();
  for (i = 0; i < n - 1 && i >= 0;) {
    if (s[i] == s[i + 1]) {
      s.erase(i, 2);
      n -= 2;
      cnt++;
      i = max(i - 1, (long long)0);
    } else
      ++i;
  }
  if (cnt % 2)
    cout << "Yes", cout << '\n';
  else
    cout << "No", cout << '\n';
  return 0;
}
