#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp" #ifndef DEBUG // 提出時にassertはオフ #ifndef NDEBUG #define NDEBUG #endif // 定数倍高速化 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #include using namespace std; using ll = long long; #define ALL(x) (x).begin(), (x).end() template using vec = vector; template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template constexpr T INF = 1'000'000'000; template <> constexpr int INF = 1'000'000'000; template <> constexpr ll INF = ll(INF) * INF * 2; #line 2 "main.cpp" bool solve() { int N; cin >> N; vec A(N); for(int &a : A) cin >> a; // 端は1つに、他の3連以上は2つに圧縮 // 2つに圧縮した所は自由に減らせる vec A_new; for(int num : A) { if(A_new.empty()) { A_new.push_back(num); } else if(A_new.back() != num) { A_new.push_back(num); } else { int size = A_new.size(); if(size == 1) { A_new.push_back(num); } else { if(A_new[size - 2] != num) { A_new.push_back(num); } } } } int zeroCnt = 0, oneCnt = 0, zero2Cnt = 0, one2Cnt = 0; for(int i = 0; i < (int)A_new.size(); i++) { if(A[i] == 0) { zeroCnt++; if(i > 0 && A[i - 1] == A[i]) { zero2Cnt++; } } else { oneCnt++; if(i > 0 && A[i - 1] == A[i]) { one2Cnt++; } } } if(zeroCnt < oneCnt - one2Cnt) { return false; } if(oneCnt < zeroCnt - zero2Cnt) { return false; } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T; cin >> T; for(int i = 0; i < T; i++) { cout << (solve() ? "Yes" : "No") << "\n"; } }