#include using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template ::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template typename, typename = void_t<>> struct detect : false_type {}; template typename Check> struct detect>> : true_type {}; template typename Check> constexpr inline bool detect_v = detect::value; template using has_member_sort = decltype(declval().sort()); template > auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template > auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template > T &chmin(T &l, T r, Compare &&f = less()) { return l = min(l, r, f); } template > T &chmax(T &l, T r, Compare &&f = less()) { return l = max(l, r, f); } template constexpr auto fix(F &&f) noexcept { return [f = std::tuple(std::forward(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward(args)...); }; } int main() { int t; cin >> t; while (t--) { int n; cin >> n; auto a = vec(uns, n); for (auto &e : a) cin >> e; if (count(begin(a), end(a), 1) == n) { cout << "No" << '\n'; continue; } auto dp = [&](int f) { auto dp = vec(false, 2, n + 1); dp[f][0] = true; for (int i = 1; i <= n; ++i) { auto v = a[i - 1]; if (v == 0) { dp[1][i] = dp[0][i - 1]; } if (v == 1) { dp[0][i] = dp[0][i - 1]; dp[1][i] = dp[1][i - 1]; } if (v == 2) { dp[0][i] = dp[1][i - 1]; } } return dp; }; if (a[0] == 0) { cout << ((dp(0)[0][n]) ? "Yes" : "No") << '\n'; continue; } if (a[0] == 2) { cout << ((dp(1)[1][n]) ? "Yes" : "No") << '\n'; continue; } cout << ((dp(0)[0][n] || dp(1)[1][n]) ? "Yes" : "No") << '\n'; } cout << flush; }