CF1104B.Game with string

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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

输入输出样例

输入#1
```
abacaba
```
输出#1
```
No
```
输入#2
```
iiq
```
输出#2
```
Yes
```
输入#3
```
abba
```
输出#3
```
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.

首页