#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int N=200010;
int n,a[N],pre[N],suf[N];
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> a[i];
	for(int i=1;i<=n;i++)pre[i]=pre[i-1]^a[i];
	suf[n+1]=0;
	for(int i=n;i>=1;i--)suf[i]=suf[i+1]^a[i];
	for(int i=1;i<n;i++)
		if(pre[i]!=suf[i+1]){
			cout << "YES\n";
			cout << "2\n";
			cout << 1 << ' ' << i << '\n';
			cout << i+1 << ' ' << n << '\n';
			return ;
		}
	for(int i=1;i+2<=n;i++){
		if(a[i]){
			int s=0;
			for(int j=i+1;j+1<=n;j++){
				s^=a[j];
				if(s!=0&&s!=a[i]){
					cout << "YES\n";
					cout << "3\n";
					cout << 1 << ' ' << i << '\n';
					cout << i+1 << ' ' << j << '\n';
					cout << j+1 << ' ' << n << '\n';
					return ;
				}
			}
			break;
		}
	}
	cout << "NO\n";
}
int main(){
	ios::sync_with_stdio(0);
	int T;cin >> T;
	while(T--)solve();
	return 0;
}