#include <iostream>

#include <cstdio>

#include <queue>

#include <algorithm>

#include <cmath>

#include <cstring>

#define inf 2147483647

#define N 10010

#define p(a) putchar(a)

#define For(i,a,b) for(int i=a;i<=b;++i)

//by war

//2019.8.9

using namespace std;

int T,n,ans;

int f[N],sg[N],a[N];

bool vis[N];

void in(int &x){

    int y=;char c=getchar();x=;

    while(c<''||c>''){if(c=='-')y=-;c=getchar();}

    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}

    x*=y;

}

void o(int x){

    if(x<){p('-');x=-x;}

    if(x>)o(x/);

    p(x%+'');

}

void SG(int n){

    memset(sg,,sizeof(sg));

    sort(f+,f+n+);

    For(i,,n){

        memset(vis,,sizeof(vis));

        for(int j=;j<=n&&f[j]<=i;j++)

            vis[sg[i-f[j]]]=;

        For(j,,n)

            if(!vis[j]){

                sg[i]=j;

                break;

            }

    }

}

signed main(){

    in(T);

    For(i,,1e4)

        f[i]=i;

    SG(1e4);

    while(T--){

        in(n);

        For(i,,n)

            in(a[i]);

        ans=;

        For(i,,n)

            ans^=sg[a[i]];

        if(!ans)

            puts("No");

        else

            puts("Yes");

    }

    return ;

}