#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>

#define yycoi 0

typedef long long ll;

const int T_DATA = 100000;
const int N = 300000;
const int A = 1000000;
const int Q = 300000;
const ll W = 1000000000000000000ll;

int prime[A + 10], cntp = 0;
bool notp[A + 10];

void euler_sieve() {
	cntp = 0;
	memset(notp, 0, sizeof(notp));
	notp[1] = true;
	for (int i = 2; i <= A; ++ i) {
		if (!notp[i])
			prime[++ cntp] = i;
		for (int j = 1; j <= cntp && i * prime[j] <= A; ++ j) {
			notp[i * prime[j]] = true;
			if (i % prime[j] == 0)
				break;
		}
	}
	// #if yycoi >= 2
	// for (int i = 1; i <= 30; ++ i)
	// 	printf("prime[%d]=%d\n", i, prime[i]);
	// #endif // yycoi
	return;
}

int T;
int n, a[N + 10], q;

std::map<int, int> mp;

int main() {
	scanf("%d", &T);
	euler_sieve();
	while (T --) {
		scanf("%d", &n);
		mp.clear();
		for (int i = 1; i <= n; ++ i) {
			scanf("%d", &a[i]);
			if (notp[a[i]]) {
				#if yycoi >= 2
				printf("in %d\n", a[i]);
				#endif // yycoi
				int tmp = 1;
				for (int j = 1; prime[j] * prime[j] <= a[i]; ++ j) {
					if (a[i] % prime[j] == 0) {
						int cnt = 0;
						while (a[i] % prime[j] == 0)
							++ cnt, a[i] /= prime[j];
						#if yycoi >= 2
						printf("found %d * %d\n", cnt, prime[j]);
						#endif // yycoi
						if (cnt & 1)
							tmp *= prime[j];
					}
				}
				if (a[i] != 1) {
					#if yycoi >= 2
					printf("found %d * %d\n", 1, a[i]);
					#endif // yycoi
					tmp *= a[i];
				}
				a[i] = tmp;
			}
			#if yycoi >= 2
			printf("a[%d]<-%d\n", i, a[i]);
			#endif // yycoi
			++ mp[a[i]];
		}
		int mx1 = -1, mx2 = -1, cnt1 = 0;
		for (std::pair<int, int> pr : mp) {
			mx1 = std::max(mx1, pr.second);
			if (pr.first == 1 || pr.second % 2 == 0)
				cnt1 += pr.second;
			else
				mx2 = std::max(mx2, pr.second);
		}
		mx2 = std::max(mx2, cnt1);
		scanf("%d", &q);
		for (int i = 1; i <= q; ++ i) {
			ll tmp;
			scanf("%lld", &tmp);
			if (tmp == 0)
				printf("%d\n", mx1);
			else
				printf("%d\n", mx2);
		}
	}
	return 0;
}