#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
string s;
int main()
{
int res = 0;
cin >> s;
stack<char> q;
q.push(s[0]);
for(int i = 1; i < s.size(); i++ )
if( !q.empty() && s[i] == q.top()) res ++ ,q.pop() ;
else q.push(s[i]);
if( res % 2 == 1) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}