#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int T, n, a[maxn];
int main() {
	for(scanf("%d", &T); T --; ) {
		scanf("%d", &n);
		int s = 0, nz = 0;
		for(int i = 1; i <= n; ++ i) {
			scanf("%d", &a[i]), s ^= a[i];
			if(a[i]) {
				if(nz > 0) {
					if(a[i] != nz)
						nz = -1;
				}
				else if(nz == 0) {
					nz = a[i];
				}
			}
		}
		if(nz > 0 && !s) {
			puts("NO");
			continue;
		}
		else if(s) {
			puts("YES");
			printf("1 1\n2 %d\n", n);
			continue;
		}
		int l = 1;
		while(l <= n && !a[l])
			l ++;
		int r = l + 1, x = a[r];
		while(r <= n && x == a[l] && x == 0)
			++ r, x ^= a[r];
		if(r > n) {
			puts("NO");
			continue;
		}
		puts("YES");
		printf("%d %d\n%d %d\n%d %d\n", 1, l, l + 1, r, r + 1, n);
	}
}