Flip and Shift

Black and white disks are arranged in an arbitrary order in a single row (a circular sequence) on an oval track.

In this puzzle you may use an operation called a flip. A flip takes three consecutive disks and turns the whole group over (rotates it by 180°): the middle disk stays in place while the two outer disks swap positions. (See Figure 1.) You may apply a flip to the three disks at any position on the track.

Given the color sequence of the disks arranged in a circle, write a program that decides whether a finite number of flips can gather all black disks into one contiguous block and all white disks into another contiguous block (as in Figure 2).

The first line contains the number of test cases $T$.

Each test case is given on a single line. The first number on the line is the length of the sequence $m+n$ ($10 \le m+n < 30$), followed by $m+n$ numbers describing the disks. Each number is the color of a disk: $0$ is a white disk and $1$ is a black disk. Here $m$ is the number of white ($0$) disks and $n$ is the number of black ($1$) disks. All numbers are separated by spaces.

For each test case, print YES on its own line if the white and black disks can be separated into two contiguous blocks, and NO otherwise.