#include<bits/stdc++.h>
#define ll long long 
#define mp make_pair
#define pb push_back

using namespace std;

const int inf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3fll;
inline long long read(){
    long long s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9') {if (ch=='-') w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}

void doit(){
    int n=read();
    map<int,int>q;
    vector<int>a(n+1);
    int ff=0;
    long long k=0;
    for(int i=1;i<=n;i++) {
        a[i]=read();
        k=k^a[i];
        if (q[a[i]]) ff=1;
        q[a[i]]++;
        if (q[a[i]]==n&&a[i]==0){
             printf("NO\n");
            return ;
        }
        if (q[a[i]]==n&&n%2==0) {
            printf("NO\n");
            return ;
        }
    }
     printf("YES\n");
    if (k!=0){
        printf("2\n");
        printf("1 1\n2 %d\n",n);
        return;
    }
    k=k^a[1];
    printf("3\n");
    long long now=0;
    for(int i=2;i<=n-1;i++){
        now=now^a[i];
        if (now!=a[1]&&(k^now)!=a[1]&&(k^now)!=now) {
            printf("1 1\n2 %d\n%d %d\n",i,i+1,n);
            return ;
        }
    }
}

int  main(){
    // freopen("input.in","r",stdin);
    // freopen("output.out","w",stdout);
    int T=read();
    while(T--){
    doit();
    }
    return 0;
}