B. Substring Removal Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Alice and Bob play a game. They have a binary string ss (a string such that each character in it is either 00 or 11). 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 ss and delete them.

For example, if the string is 1011010110, there are 66 possible moves (deleted characters are bold):

1. 10110→011010110→0110;
2. 10110→111010110→1110;
3. 10110→101010110→1010;
4. 10110→101010110→1010;
5. 10110→10010110→100;
6. 10110→101110110→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: 10110→100→110110→100→1.

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

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

Input

The first line contains one integer TT (1≤T≤5001≤T≤500) — the number of test cases.

Each test case contains exactly one line containing a binary string ss (1≤|s|≤1001≤|s|≤100).

Output

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

Example

input

Copy

5
01111001
0000
111111
101010101
011011110111

output

Copy

4
0
6
3
6

Note

Questions about the optimal strategy will be ignored.

 

解题说明：此题可以采用贪心，分析可知双方每次操作一定是取连续1最多的区间消掉，于是就统计出1的区间进行排序，Alice每次选择连续出现1最多的，求和时就是从大到小中间间隔一个，那个由Bob选了。

#include
#include
#include
using namespace std;
int a[100005];

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		string s;
		cin >> s;
		int cnt = 0, len = 0;
		for (int i = 0; i= 1; i -= 2)
		{
			ans += a[i];
		}
		cout << ans << endl;
	}
	return 0;
}