#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template std::vector> run_length_encoding(const U& s) { const int n = s.size(); std::vector> res; if (n == 0) [[unlikely]] return res; T ch = s.front(); int num = 1; for (int i = 1; i < n; ++i) { if (s[i] != ch) { res.emplace_back(ch, num); num = 0; } ch = s[i]; ++num; } res.emplace_back(ch, num); return res; } bool solve() { int n; cin >> n; vector a(n); REP(i, n) cin >> a[i]; const auto rle = run_length_encoding(a); if (rle.size() % 2 == 0) return true; for (int i = 1; i < rle.size(); i += 2) { if (rle[i].second >= 2) return true; } return false; } int main() { int t; cin >> t; while (t--) cout << (solve() ? "Yes\n" : "No\n"); return 0; }