#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	int xs = 0;
	for (int &x : a) {
		cin >> x;
		xs ^= x;
	}
	if (xs) {
		cout << "YES" << "\n";
		cout << 2 << "\n";
		for (int i = 0, now = 0; i < n; i++) {
			now ^= a[i];
			if (now) {
				cout << 1 << " " << i + 1 << "\n";
				cout << i + 2 << " " << n << "\n";
				return;
			}
		}
		assert(0);
	}
	multiset<pair<int, int>> se;
	vector<int> suf(n);
	for (int i = n - 1, now = 0; i >= 0; i--) {
		now ^= a[i], suf[i] = now;
		if (now) se.insert({now, i});
	}
	for (int i = 0, now = 0; i < n - 1; i++) {
		if (suf[i]) se.erase(se.find({suf[i], i}));
		now ^= a[i];
		if (!now) continue;
		if (se.lower_bound({now, 0}) == se.begin()
		 && se.lower_bound({now + 1, 0}) == se.end()) {
			continue;
		}
		if (se.empty()) continue;
		auto it = se.begin();
		if (it->first == now) it = se.lower_bound({now + 1, 0});
		if (it != se.end() && it->first != now) {
			int j = it->second;
			cout << "YES" << "\n" << 3 << "\n";
			cout << 1 << " " << i + 1 << "\n";
			cout << i + 2 << " " << j << "\n";
			cout << j + 1 << " " << n << "\n";
			return;
		}
	}
	cout << "NO" << "\n";
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}