#include <iostream>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N = 2e5+5;
int n,a[N],s[N];
void solve(){
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",a+i);
	rep(i,1,n) s[i] = s[i-1]^a[i];
	if(s[n]!=0){
		rep(i,1,n) if(s[i]!=s[n]){
			puts("YES");
			printf("2\n1 %d\n%d %d\n",i,i+1,n);
			return ;
		}
	}else{
		int m = n+1;
		per(i,n-1,1) if(s[i]!=0){
			m = i; break;
		}
		if(m == n+1){
			puts("NO");
			return ;
		}
		rep(i,1,m) if(s[i]!=s[m]&&s[i]!=0){
			puts("YES");
			printf("3\n1 %d\n%d %d\n%d %d\n",i,i+1,m,m+1,n);
			return ;
		}
	}
	puts("NO");
}

int main(){
	int T; scanf("%d",&T);
	while(T--) solve();
	return 0;
}