#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>  
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <time.h>
#include <bitset>
#include <random>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ITER(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(A,value) memset(A,value,sizeof(A))

#define ALL(V) V.begin(), V.end()
#define SZ(V) (int)V.size()
#define PB push_back
#define MP make_pair
const double PI=acos(-1.0);

typedef long long Int;
typedef long long LL;
typedef unsigned long long UINT;
typedef vector <int> VI;
typedef pair <int, int> PII;
typedef pair <double, double> PDD;

const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL) INF;

const int MAX = 100007;
const int MAXK = 51;
const int MAX2 = 24000000;
const int LEN = 21;
const int BASE = 1000000000;

int t, n;

int main()
{
  cin >> t;

  FOR (tt,0,t)
  {
    scanf("%d", &n);

    int c2 = 0;
    VI X;

    FOR (i,0,n)
    {
      int x;
      scanf("%d", &x);
      if (x == 2) ++ c2;
      else if (x > 2)
      {
        X.PB(x);
      }
    }

    bool same3 = !X.empty() && X[0] == X.back();

    bool res = SZ(X) == 0 || (SZ(X) == 1 && c2 == 1) || (SZ(X) <= 2 && c2 == 0) || (SZ(X) == 3 && same3 && c2 == 0);

    printf(res ? "No\n" : "Yes\n");
  }


  return 0;
}