#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;

const int INF = 1e9;
const ll LINF = 1e18;
const int MAX = 100010;

bool solve() {
    int n;
    cin >> n;
    V<int> a(n);
    rep(i, n) cin >> a[i];
    int i = -1;
    rep(j, n) {
        if (a[j] == 2) i = j;
    }
    if (i == -1) return false;
    V<int> b(n, -1);
    while (b[i] == -1) {
        int l = (i - 1 + n) % n;
        if (a[i] == 2) {
            if (b[l] == '<') return false;
            b[i] = '<';
        } else if (a[i] == 0) {
            if (b[l] == '>') return false;
            b[i] = '>';
        } else {
            assert(b[l] != -1);
            b[i] = b[l];
        }
        i = (i + 1) % n;
    }
    int l = (i - 1 + n) % n;
    if (b[l] != '>') return false;
    return true;
}

int main() {
    speedUpIO();
    int t = 1;
    cin >> t;
    while (t--) {
        // solve();
        // cout << solve() << "\n";
        cout << (solve() ? "Yes" : "No") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}