#include <bits/stdc++.h>
 //#define int long long
#define help {cin.tie(NULL); cout.tie(NULL);}
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
using namespace std;
 
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
 
template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }
 
template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N=10005;
int t,n,k,q;
LL x,a[N];
int main()
{
    scanf("%d",&t);
    for(int T=1;T<=t;T++)
    {
    	printf("Case #%d:\n",T);
    	scanf("%d",&n);
    	for(int i=0;i<n;i++)scanf("%lld",&a[i]);
    	k=0;
    	for(int i=62;i>=0;i--)
    	{
    		for(int j=k;j<n;j++)
    			if(a[j]>>i&1)
    			{
    				swap(a[k],a[j]);
    				break;
    			}
    		if(!(a[k]>>i&1))continue;
    		for(int j=0;j<n;j++)
    			if(j!=k&&(a[j]>>i&1))a[j]^=a[k];
    		k++;
    		if(k==n)break;
    	}
    	reverse(a,a+k);
    	bool f=k<n;
    	scanf("%d",&q);
    	while(q--)
    	{
    		scanf("%lld",&x);
    		x-=f;
    		if(x>=(1ll<<k))
    		{
    			puts("-1");
    			continue;
    		}
    		LL res=0;
			for(int i=0;i<k;i++)
				if(x>>i&1)res^=a[i];
    		printf("%lld\n",res);
    	}
    }
    return 0;
}