#include<bits/stdc++.h>

using namespace std;


typedef long long ll;
typedef long int li;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pii;
//typedef long long int;

#define endl "\n"
#define f(i,a,b) for(int i=a;i<=(b);i++)
#define r(i,a,b) for(int i=a;i>=(b);i--)
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define mid(s,l) (s+(l-s)/2)
#define umap unordered_map
#define pb push_back
#define mp make_pair
//#define int long long

//const int INF = int(1e9);
//const int MOD = int(1e9) + 7;
//const ld EPS = 1e-18;
//const ld PI = acos(-1.0); 

void GG()
{
	int n;
	cin >> n;
	vector<int> v(n + 1);
	vector<int> pref(n + 1);
	int fnz = -1;
	for(int i = 1; i <= n; i++){
		cin >> v[i];
		if(v[i] > 0 && fnz == -1) fnz = i;
		pref[i] = pref[i - 1] ^ v[i];
	}
	if(n == 2){
		if(v[1] == v[2]) cout << "NO" << endl;
		else{
			cout << "YES" << endl;
			cout << 2 << endl;
			cout << 1 << ' ' << 1 << endl;
			cout << 2 << ' ' << 2 << endl;
		}
		return;
	}
	else{
		int ls = v[1];
		int rs = v[n];
		int ms = pref[n - 1] ^ pref[1];
		if(ls != ms && ls != rs && ms != rs){
			cout << "YES" << endl;
			cout << 3 << endl;
			cout << 1 << ' ' << 1 << endl;
			cout << 2 << ' ' << n - 1 << endl;
			cout << n << ' ' << n << endl;
			return;
		}
		else if(ls == ms && ms == rs && rs == 0){
			if(fnz == -1) {cout << "NO" << endl; return;}
			else{
				ls = pref[fnz];
				//cout << fnz << endl;
				for(int i = n - 1; i > fnz + 1; i--){
					int val = pref[n - 1] ^ pref[i - 1];
					//cout << i << ' ' << fnz << ' ' << val << endl;
					if(val != 0 && val != ls){
						cout << "YES" << endl;
						cout << 3 << endl;
						cout << 1 << ' ' << fnz << endl;
						cout << fnz + 1 << ' ' << i - 1 << endl;
						cout << i << ' ' << n << endl;
						return;
					}
				}
			}
			cout << "NO" << endl;
			return;
		}
		else if(ls == ms && rs == 0){
			for(int i = n - 1; i > 2; i--){
				int val = pref[n - 1] ^ pref[i - 1];
				if(val != 0 && val != ls){
					cout << "YES" << endl;
					cout << 3 << endl;
					cout << 1 << ' ' << 1 << endl;
					cout << 2 << ' ' << i - 1 << endl;
					cout << i << ' ' << n << endl;
					return;
				}
			}
			cout << "NO" << endl;
			return;
		}
		else if(ls == rs && ms == 0){
			for(int i = 2; i < n - 1; i++){
				int val = pref[i] ^ pref[1];
				if(val != 0 && val != ls){
					cout << "YES" << endl;
					cout << 3 << endl;
					cout << 1 << ' ' << i << endl;
					cout << i + 1 << ' ' << n - 1 << endl;
					cout << n << ' ' << n << endl;
					return;
				}
			}
			cout << "NO" << endl;
			return;
		}
		else if(ms == rs && ls == 0){
			for(int i = 2; i < n - 1; i++){
				int val = pref[i] ^ pref[1];
				if(val != 0 && val != ls){
					cout << "YES" << endl;
					cout << 3 << endl;
					cout << 1 << ' ' << i << endl;
					cout << i + 1 << ' ' << n - 1 << endl;
					cout << n << ' ' << n << endl;
					return;
				}
			}
			cout << "NO" << endl;
			return;
		}
		else{
			cout << "YES" << endl;
			cout << 2 << endl;
			cout << 1 << ' ' << n - 1 << endl;
			cout << n << ' ' << n << endl;
		}
	}
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int ttc=1;
	cin>>ttc;
	//int cnt=0;
	while(ttc--)
	{
		//cout<<"Case "<<++cnt<<": ";
		GG();
	}
}