#include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;

int main() {
    string s;
    cin >> s;
    stack<char> stk;
    int cnt = 0;
    for (int i = 0; i < s.size(); i++) {
        if (stk.empty() || stk.top() != s[i]) {
            stk.push(s[i]);
        } else {
            stk.pop();
            cnt++;
        }
    }
    if (cnt % 2 == 1) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}