A. Make it White
greedy; strings
You have a horizontal strip of \(n\) cells. Each cell is either white or black.You can choose a continuous segment of cells once and paint them all white. After this action, all the black cells in this segment will become white, and the white ones will remain white.What is the minimum length of the segment that needs to be painted white in order for all \(n\) cells to become white?
The first line of the input contains a single integer \(t\) (\(1 \le t \le 10^4\)) — the number of test cases. The descriptions of the test cases follow.The first line of each test case contains a single integer \(n\) (\(1 \le n \le 10\)) — the length of the strip.The second line of each test case contains a string \(s\), consisting of \(n\) characters, each of which is either 'W' or 'B'. The symbol 'W' denotes a white cell, and 'B' — a black one. It is guaranteed that at least one cell of the given strip is black.
For each test case, output a single number — the minimum length of a continuous segment of cells that needs to be painted white in order for the entire strip to become white.
In the first test case of the example for the strip ""WBBWBW"", the minimum length of the segment to be repainted white is \(4\). It is necessary to repaint to white the segment from the \(2\)-nd to the \(5\)-th cell (the cells are numbered from \(1\) from left to right).