#include <iostream>
#include <vector>

int main() {
    int t;
    std::cin >> t;

    for (int i = 0; i < t; i++) {
        int n;
        std::cin >> n;
        std::vector<int> a(n);
        for (int j = 0; j < n; j++) {
            std::cin >> a.at(j);
        }

        // 2となる位置
        int index = -1;
        for (int j = 0; j < n; j++) {
            if (a.at(j) == 2) {
                index = j;
                break;
            }
        }
        if (index == -1) {
            std::cout << "No" << std::endl;
        } else {
            int prev = 2;
            bool flag = true;
            for (int j = index; j < index + n; j++) {
                // 次のインデックスが矛盾を起こすかどうか
                int k = (j + 1) % n;
                if ((a.at(k) == 2 && prev == 2) || (a.at(k) == 0 && prev == 0)) {
                    std::cout << "No" << std::endl;
                    flag = false;
                    break;
                } else {
                    prev = a.at(k);
                }
            }
            if (flag) std::cout << "Yes" << std::endl;
        }
    }
}