Game with string

## 题目描述 $\text{A}$ 与 $\text{B}$ 正在玩一个关于由小写拉丁字符构成的字符串 $s$ 的游戏 每一个人会轮流操作，先 $\text{A}$ 后 $\text{B}$ 对于每一次操作，操作者需要将 $s$ 中的两个 __连续且相同__ 的字符消除，消除后的字符串由另一个人操作 同样的，对于每一次操作，如果不能找到两个符合要求的字符，那么操作者输 例如以下情况： $s = ''xaax''$ 首先是 $\text{A}$ 操作，他只能将 $''aa''$ 删除，剩下 $''xx''$，被 $\text{B}$ 消除后字符串为空，$\text{A}$ 不能找到符合的字符串，故 $\text{A}$ 输 ## 输入输出格式 ### 输出格式 第一行为字符串 $s$，( $1 \leq |s| \leq 100000$ ) ### 输出格式 若 $\text{A}$ 可以获胜则输出 $\text{Yes}$，否则输出 $\text{No}$

Two people are playing a game with a string $ s $ , consisting of lowercase latin letters. On a player's turn, he should choose two consecutive equal letters in the string and delete them. For example, if the string is equal to "xaax" than there is only one possible turn: delete "aa", so the string will become "xx". A player not able to make a turn loses. Your task is to determine which player will win if both play optimally.

The only line contains the string $ s $ , consisting of lowercase latin letters ( $ 1 \leq |s| \leq 100\,000 $ ), where $ |s| $ means the length of a string $ s $ .

If the first player wins, print "Yes". If the second player wins, print "No".

abacaba

No

iiq

Yes

abba

No

In the first example the first player is unable to make a turn, so he loses. In the second example first player turns the string into "q", then second player is unable to move, so he loses.