#include<bits/stdc++.h>
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n;
    n = read();
    vector<int> a(n + 1), sum(n + 1);
    for (int i = 1; i <= n; i++) a[i] = read();
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] ^ a[i];
    vector<int> T;
    for (int i = 1; i <= n; i++) 
        if (sum[i]) T.push_back(sum[i]);
    sort(T.begin(), T.end());
    T.erase(unique(T.begin(), T.end()), T.end());
    if (sum[n] == 0 && T.size() <= 1) printf("NO\n"); 
    else {
        printf("YES\n");
        if (sum[n]) {
            printf("2\n");
            int A = T[0], pos = 1;
            for (int i = 1; i < n; i++) 
                if (sum[i] == A) pos = i;
            printf("%d %d\n", 1, pos);
            printf("%d %d\n", pos + 1, n);
        }
        else {
            printf("3\n");
            int A = T[0], B = T[1], l = 0, r = 0;
            for (int i = 1; i < n; i++) {
                if (sum[i] == A) l = i;
                if (sum[i] == B) r = i;
            }
            if (l > r) swap(l, r);
            printf("%d %d\n", 1, l);
            printf("%d %d\n", l + 1, r);
            printf("%d %d\n", r + 1, n);
        }
    }
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}