#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;

void solve() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];

    int s = -1;
    rep(i, N) {
        if (A[i] != 1) {
            s = i;
            break;
        }
    }

    if (s == -1) {
        cout << "No\n";
        return;
    }

    vector<pair<int, int>> r(N);
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
        int i = q.front();
        q.pop();

        int rid = (i + 1) % N;
        int lid = (i - 1 + N) % N;

        if (A[i] == 0)
            r[i] = {-1, 1};
        else if (A[i] == 2)
            r[i] = {1, -1};
        else {
            if (r[rid] == make_pair(0, 0))
                r[i] = {r[lid].second, r[lid].second};
            else
                r[i] = {r[rid].first, r[rid].first};
        }

        if (r[rid] == make_pair(0, 0)) q.push(rid);
        if (r[lid] == make_pair(0, 0)) q.push(lid);
    }

    // check
    rep(i, N) {
        int j = (i + 1) % N;

        if (r[i].second != r[j].first) {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int T;
    cin >> T;
    while (T--) solve();

    return 0;
}