CF1398B.Substring Removal Game

Alice and Bob play a game. They have a binary string $s$ (a string such that each character in it is either $0$ or $1$). Alice moves first, then Bob, then Alice again, and so on.

During their move, the player can choose any number (not less than one) of consecutive equal characters in $s$ and delete them.

For example, if the string is $10110$, there are $6$ possible moves (deleted characters are bold):

1. $\textbf{1}0110 \to 0110$;
2. $1\textbf{0}110 \to 1110$;
3. $10\textbf{1}10 \to 1010$;
4. $101\textbf{1}0 \to 1010$;
5. $10\textbf{11}0 \to 100$;
6. $1011\textbf{0} \to 1011$.

After the characters are removed, the characters to the left and to the right of the removed block become adjacent. I. e. the following sequence of moves is valid: $10\textbf{11}0 \to 1\textbf{00} \to 1$.

The game ends when the string becomes empty, and the score of each player is the number of $1$-characters deleted by them.

Each player wants to maximize their score. Calculate the resulting score of Alice.

爱丽丝和鲍勃玩一个游戏。他们有一个二进制字符串 $s$（即字符串中每个字符均为 $0$ 或 $1$）。爱丽丝先手，然后是鲍勃，接着又是爱丽丝，依此类推。

在自己的回合中，玩家可以选择 $s$ 中任意一段长度至少为一的、由相同字符组成的连续子串，并将其删除。

例如，若字符串为 $10110$，则有 $6$ 种可能的操作（被删除的字符加粗显示）：

1. $\textbf{1}0110 \to 0110$；
2. $1\textbf{0}110 \to 1110$；
3. $10\textbf{1}10 \to 1010$；
4. $101\textbf{1}0 \to 1010$；
5. $10\textbf{11}0 \to 100$；
6. $1011\textbf{0} \to 1011$。

删除字符后，被删子串左侧与右侧的字符变为相邻。例如，如下操作序列是合法的：$10\textbf{11}0 \to 1\textbf{00} \to 1$。

当字符串变为空时游戏结束，每位玩家的得分为其删除的字符中 $1$ 的个数。

双方均采取最优策略以最大化自身得分。请计算爱丽丝最终的得分。

The first line contains one integer $T$ ($1 \le T \le 500$) — the number of test cases.

Each test case contains exactly one line containing a binary string $s$ ($1 \le |s| \le 100$).

第一行包含一个整数 $T$（$1 \le T \le 500$）—— 表示测试用例的数量。

每个测试用例恰好包含一行，该行包含一个二进制字符串 $s$（$1 \le |s| \le 100$）。

For each test case, print one integer — the resulting score of Alice (the number of $1$-characters deleted by her).

对于每个测试用例，输出一个整数——Alice 的最终得分（即她删除的字符 1 的个数）。

Questions about the optimal strategy will be ignored.

关于最优策略的问题将被忽略。