Unique Adjacent Characters

Coder at Codedamn has a binary sequence $SS$ of length $NN$. Coder can execute the following adjustment on $SS$:

• Append any digit ($00$ or $11$) into any spot within $SS$.

Determine the least number of adjustments Coder must implement so that $SS$ doesn't have any adjacent matching digits.

Input Format

• The initial line contains a single integer $TT$ — the count of scenarios to evaluate. Following are the scenarios.
• The first line in each scenario presents an integer $NN$ — the length of the binary sequence $SS$.
• The subsequent line in each scenario showcases a binary sequence $SS$ of length $NN$, consisting solely of $00$s and $11$s.

Output Format

For every scenario, print on a new line the minimal number of adjustments Coder needs to make to ensure no adjacent digits in $SS$ are identical.

Limitations

• $1\le T\le 1001\; \backslash leq\; T\; \backslash leq\; 100$
• $1\le N\le 10001\; \backslash le\; N\; \backslash le\; 1000$

Example Test Cases (with explanation)

Scenario #1:

Input:

3
2
11
4
0101
5
00100

Output:

1
0
2

Explanation

Scenario 1: The following adjustments can be made: $11\to 1\underset{‾}{0}111\; \backslash rightarrow\; 1\backslash underline\{0\}1$.

Scenario 2: No adjustments are needed.

Scenario 3: These adjustments can be executed: $00100\to 0\underset{‾}{1}0100\to 01010\underset{‾}{1}000100\; \backslash rightarrow\; 0\backslash underline\{1\}0100\; \backslash rightarrow\; 01010\backslash underline\{1\}0$.