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

#define ff first
#define ss second
#define pb push_back

typedef long long ll;
typedef pair <int,int> pii;

const int N = 200'005;

int pref[N];

int main () {
        
    #ifndef LOCAL
    #endif

    int t;
    scanf ( "%d", &t );
    while (t--) {
        int n;
        scanf ( "%d", &n );
        map <int, int> mp;
        int mini = 1 << 30, maxi = 0;
        for ( int i = 1; i <= n; ++i ) {
            int curr;
            scanf ( "%d", &curr );
            pref[i] = pref[i-1] ^ curr;
            mp[pref[i]] = i;
            if ( pref[i] != 0 ) {
                mini = min ( mini, pref[i] );
                maxi = max ( maxi, pref[i] );
            }
        }

        if ( pref[n] != 0 ) {
            printf ( "YES\n2\n1 1\n2 %d\n", n );
        } else {
            if ( mp.size() <= 2 ) {
                printf ( "NO\n" );
            } else {
                int min_i = mp[mini], max_i = mp[maxi];
                if ( min_i > max_i ) swap ( min_i, max_i );
                printf ( "YES\n3\n1 %d\n%d %d\n%d %d\n", min_i, min_i+1, max_i, n, n );
            }
        }
    }

    return 0;
}