#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn=200000;
ll T,n;
ll a[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> T;
	for (;T--;){
		cin >> n;
		for (int i=1;i<=n;i++) cin >> a[i];
		
		ll sum=0;
		for (int i=1;i<=n;i++) sum^=a[i];
		if (sum!=0){
			cout << "YES" << "\n";
			cout << 2 << "\n";
			cout << 1 << " " << 1 << "\n";
			cout << 2 << " " << n << "\n";
			continue;
		}
		int pos=0;
		for (int i=1;i<=n;i++) if (a[i]!=a[1]){pos=i;break;}
		
		if (pos==0){
			cout << "NO" << "\n";
			continue;
		}
		
		if (pos%2==1){
			vector<pair<int,int>> ans;
			if (1<=pos-2) ans.emplace_back(1,pos-2);
			if (pos-1<=pos) ans.emplace_back(pos-1,pos);
			if (pos+1<=n) ans.emplace_back(pos+1,n);
			cout << "YES" << "\n";
			cout << ans.size() << "\n";
			for (auto [x,y]:ans) cout << x << " " << y << "\n";
			continue;
		}
		else{
			vector<pair<int,int>> ans;
			if (1<=pos-1) ans.emplace_back(1,pos-1);
			if (pos<=pos) ans.emplace_back(pos,pos);
			if (pos+1<=n) ans.emplace_back(pos+1,n);
			cout << "YES" << "\n";
			cout << ans.size() << "\n";
			for (auto [x,y]:ans) cout << x << " " << y << "\n";
			continue;
		}
	}
	return 0;
}