s = list(input())
i = 0
turn = 0
while i<len(s)-1:
if s[i] == s[i + 1]:
turn += 1
s.pop(i + 1)
s.pop(i)
if i == 0:
continue
i -= 1
continue
i += 1
if turn & 1:
print('Yes')
else:
print('No')#include <bits/stdc++.h>
#define ll long long
#define go ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl "\n"
using namespace std;
inline void solve() {
string s;
cin >> s;
bool flag = false;
stack<char> st;
for (int i = 0; i < s.size(); i++) {
if (st.empty())
st.push(s[i]);
else if (st.top() == s[i]) {
st.pop();
flag = !flag;
}
else
st.push(s[i]);
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main()
{
go;
int t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |
1646C - Factorials and Powers of Two | 596A - Wilbur and Swimming Pool |
1462B - Last Year's Substring | 1608B - Build the Permutation |
1505A - Is it rated - 2 | 169A - Chores |