#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2e5 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

void solve(){
    int n;
    cin >> n;
    vi a(n + 1);
    vi pref(n + 1);
    map<int, int> pos;
    
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    
    for(int i = 1; i <= n; i++){
        pref[i] = (pref[i - 1] ^ a[i]);
        pos[pref[i]] = i;
    }
    if(pref[n] != 0){
        cout << "YES\n2\n";
        cout << 1 << ' ' << n - 1 << '\n';
        cout << n << ' ' << n << '\n';
        return;
    } else {
        set<int> s;
        s.insert(pref[1]);
        for(int j = 2; j <= n - 1; j++){
            if(pref[j] != 0){
                int x = (pref[n] ^ pref[j]);
                
                bool flag1 = false, flag2 = false;
                int val1, val2;

                auto it = s.find(x);
                if(it != s.end()){
                    val1 = (*it);
                    s.erase(it);
                    flag1 = true;
                }
                
                it = s.find(pref[n]);
                if(it != s.end()){
                    val2 = (*it);
                    s.erase(it);
                    flag2 = true;
                }
                if(!s.empty()){
                    int val = pos[(*s.begin())];
                    cout << "YES\n3\n";
                    cout << 1 << ' ' << val << '\n';
                    cout << val + 1 << ' ' << j << '\n';
                    cout << j + 1 << ' ' << n << '\n';
                    return;
                }
                
                if(flag1)s.insert(val1);
                if(flag2)s.insert(val2);
            }
            s.insert(pref[j]);
        }
    }
    cout << "NO\n";
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}