func_code_string: #include<bits/stdc++.h>      using namespace std;   typedef long long ll;   const int N=2e5+10,mod=1e9+7;   ll a[N];   #define PII pair<int,int>   #define x first   #define y second   #define PB push_back   void solve()   {    int n;       cin>>n;       int sum=0;       map<ll,int> mp;       for(int i=1;i<=n;i++){           cin>>a[i];       }       bool flag=1;       if(n==2){           if(a[1]==a[2]){               cout<< YES <<endl;           }           else cout<< NO <<endl;           return;       }       ll ans=0;       for(int i=1;i<=n;i++){           ans=(ans^a[i]);       }       if(ans==0){           cout<< YES <<endl;return;       }       int cnt=0;       ll ans1=0;          for(int i=1;i<=n;i++){           ans1=(ans1^a[i]);           if(ans1==ans){cnt++;ans1=0;}           if(cnt==2){               cout<< YES <<endl;return;           }           }       cout<< NO <<endl;   }   int main()   {    ios::sync_with_stdio(false);    cin.tie(0);    cout.tie(0);    int t;    cin >> t;    while (t--)     solve();   }