# Unique Adjacent Characters

Easy

1

27.8% Acceptance

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

- Append any digit ($0$ or $1$) into any spot within $S$.

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

## Input Format

- The initial line contains a single integer $T$ — the count of scenarios to evaluate. Following are the scenarios.
- The first line in each scenario presents an integer $N$ — the length of the binary sequence $S$.
- The subsequent line in each scenario showcases a binary sequence $S$ of length $N$, consisting solely of $0$s and $1$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 $S$ are identical.

## Limitations

- $1 \leq T \leq 100$
- $1 \le N \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 \rightarrow 1\underline{0}1$.

**Scenario 2:** No adjustments are needed.

**Scenario 3:** These adjustments can be executed: $00100 \rightarrow 0\underline{1}0100 \rightarrow 01010\underline{1}0$.