func_code_string: #pragma GCC optimize( Ofast )      #include <iostream>   #include <fstream>   #include <algorithm>   #include <functional>   #include <array>   #include <chrono>   #include <random>   #include <vector>   #include <string>   #include <sstream>   #include <cmath>   #include <cstring>   #include <bitset>   #include <list>   #include <stack>   #include <queue>   #include <set>   #include <map>   #include <cassert>      #define sq(x) ((x) * (x))   #define err(x) cerr <<  [ #x ]    << (x) <<   n ;   #define errp(x) cerr <<  [ #x ]  {  << ((x).first) <<  ,   << ((x).second) <<  } n ;   #define errv(x) {cerr <<  [ #x ]  [ ;for(const auto& ___ : (x)) cerr << ___ <<  ,  ; cerr <<  ] n ;}   #define errvn(x, n) {cerr <<  [ #x ]  [ ;for(auto ___ = 0; ___ < (n); ++___) cerr << (x)[___] <<  ,  ; cerr <<  ] n ;}   #define errf() cerr <<   n n ;      using namespace std;      using ll = long long;   using ull = unsigned long long;   using ld = long double;      mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   ll getrnd(ll l, ll r) {       return uniform_int_distribution<ll>(l, r)(rng);   }      template <typename T1, typename T2> inline bool relax(T1& a, const T2& b) {       return a > b ? a = b, true : false;   }      template <typename T1, typename T2> inline bool strain(T1& a, const T2& b) {       return a < b ? a = b, true : false;   }      // :::::::::::::::::::::::::::::::      void solve() {       int n;       cin >> n;              int x = 0;       vector<int> a(n);       for (int i = 0; i < n; ++i) {           cin >> a[i];           x ^= a[i];       }              int cur = 0;       for (int i = 0; i < n; ++i) {           cur ^= a[i];           if (cur == (x ^ cur)) {               cout <<  YES n ;               return;           }       }              cur = 0;       for (int i = 0; i < n; ++i) {           cur ^= a[i];           int sec = 0;           for (int j = i + 1; j < n - 1; ++j) {               sec ^= a[j];               if (cur == sec && sec == (cur ^ sec ^ x)) {                   cout <<  YES n ;                   return;               }           }       }       cout <<  NO n ;   }      int main() {       ios::sync_with_stdio(0);       cin.tie(nullptr); cout.tie(nullptr);              int t = 1;       cin >> t;       while (t--)           solve();              return 0;   }   