CF1104B.Game with string

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.

两人正在用一个由小写拉丁字母组成的字符串 $s$ 进行游戏。

在一名玩家的回合中，他必须选择字符串中两个相邻且相等的字母，并将它们删除。

例如，若字符串为 "xaax"，则仅有一种可能的操作：删除 "aa"，字符串将变为 "xx"。无法进行任何操作的玩家判负。

你的任务是判断：若双方均采取最优策略，哪位玩家将获胜？

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$.

唯一的一行包含字符串 $s$，该字符串由小写拉丁字母组成（$1 \leq |s| \leq 100\,000$），其中 $|s|$ 表示字符串 $s$ 的长度。

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

如果先手玩家获胜，输出“Yes”；如果后手玩家获胜，输出“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.

在第一个例子中，先手玩家无法进行操作，因此输掉游戏。

在第二个例子中，先手玩家将字符串变为“q”，随后后手玩家无法进行操作，因此输掉游戏。