#![allow(unused_imports, dead_code, unused_macros, unused_variables, non_snake_case, unused_parens)]
use std::cmp::{min,max,Ordering,Reverse};
use std::mem::swap;
use std::collections::{VecDeque,LinkedList,HashMap,BTreeMap,HashSet,BTreeSet,BinaryHeap};

const YES:&str="Yes";const NO:&str="No";#[inline]fn print_yesno(ans:bool){if ans{println!("{}",YES);}else{println!("{}",NO);}}


fn solve() -> bool {
	let n: usize = {
		let mut line: String = String::new();
		std::io::stdin().read_line(&mut line).unwrap();
		line.trim().parse().unwrap()
	};
	let A: Vec<i64> = {
		let mut line: String = String::new();
		std::io::stdin().read_line(&mut line).unwrap();
		line.split_whitespace()
			.map(|x| x.parse().unwrap())
			.collect()
	};
	let mut n0 = 0;
	let mut n2 = 0;
	let mut flg = 1;
	for i in 0..n {
		if A[i] == 0 {
			n0+=1;
			if i>0 && A[i-1] == 0 || i==0 && A[n-1]==0 {
				return false;
			}
			if flg==0{return false;}
			flg = 0;
		}else if A[i] == 2 {
			n2+=1;
			if i>0 && A[i-1] == 2 || i==0 && A[n-1]==2 {
				return false;
			}
			if flg==2{return false;}
			flg = 2;
		}
	}
	n0 == n2 && n0 > 0
}

fn main() {
	let t: usize = {
		let mut line: String = String::new();
		std::io::stdin().read_line(&mut line).unwrap();
		line.trim().parse().unwrap()
	};
	for _ in 0..t {
		print_yesno(solve());
	}
}