Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

greedy

strings

two pointers

*1600

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Binary String

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputYou are given a string $$$s$$$ consisting of characters 0 and/or 1.

You have to remove several (possibly zero) characters from the beginning of the string, and then several (possibly zero) characters from the end of the string. The string may become empty after the removals. The cost of the removal is the maximum of the following two values:

- the number of characters 0 left in the string;
- the number of characters 1 removed from the string.

What is the minimum cost of removal you can achieve?

Input

The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

Each test case consists of one line containing the string $$$s$$$ ($$$1 \le |s| \le 2 \cdot 10^5$$$), consisting of characters 0 and/or 1.

The total length of strings $$$s$$$ in all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, print one integer — the minimum cost of removal you can achieve.

Example

Input

510111011010010010010010000111111000001111

Output

1 3 0 0 0

Note

Consider the test cases of the example:

- in the first test case, it's possible to remove two characters from the beginning and one character from the end. Only one 1 is deleted, only one 0 remains, so the cost is $$$1$$$;
- in the second test case, it's possible to remove three characters from the beginning and six characters from the end. Two characters 0 remain, three characters 1 are deleted, so the cost is $$$3$$$;
- in the third test case, it's optimal to remove four characters from the beginning;
- in the fourth test case, it's optimal to remove the whole string;
- in the fifth test case, it's optimal to leave the string as it is.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/05/2023 04:22:54 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|