#include<bits/stdc++.h>
#include<iostream>
using namespace std;
 
#define int long long int
#define double long double
 
#define all(x) (x).begin(), (x).end()
#define RemoveDuplicates(a) a.resize(unique(all(a))-a.begin())
#define endl '\n'
 
#ifndef ONLINE_JUDGE
template<typename T>		
void __p(T a) {
  cerr<<a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cerr<<"[";
  __p(a.first);
  cerr<<",";
  __p(a.second);
  cerr<<"]";
}
template<typename T>
void __p(std::vector<T> a) {
  cerr<<"[";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cerr<<",]"[it+1==a.end()];
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cerr<<name<<" : ";
  __p(arg1);
  cerr<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cerr.write(names,comma-names)<<" : ";
  __p(arg1);
  cerr<<" | ";
  __f(comma+1,args...);
}
#define trace(...) cerr<<"Line:"<<__LINE__<<" ", __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...)
#endif

const int nax = 1e6+5;
vector<bool> is_prime(nax,true);
int form[nax];
void precompute(){
	form[1]=1;
	for(int i=2;i<=nax;i++){
		if(is_prime[i]){
			form[i]=i;
			for(int j=2*i;j<=nax;j+=i){
				is_prime[j]=false;
				if(form[j/i]%i==0){
					form[j]=form[j/i]/i;
				}
				else{
					form[j]=form[j/i]*i;
				}
			}
		}
	}
}
void test_case(){
	int n;
	cin>>n;
	map<int,int> cnt;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		cnt[form[x]]++;
	}
	int ans0=0,ans1=0;
	for(auto p : cnt){
		ans0=max(ans0,p.second);
		if(p.second%2==0 || p.first==1){
			ans1+=p.second;
		}
	}
	int q;
	cin>>q;
	while(q--){
		int t;
		cin>>t;
		if(t==0){
			cout<<ans0<<endl;
		}
		else{
			cout<<max(ans1,ans0)<<endl;
		}
	}
}
// ============== Notes =============== //
// common bugs
// - array bounds (indices bigger than MAXN?)
// - special cases (n=1? graph not connected?)
// - re-initialize efficiently between test cases

int32_t main(){
	
	srand(time(0));
	// Remove for Interactive Problems
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
 
	precompute();
	
	int T=1;
	cin>>T;
	for(int TT=1; TT<=T; TT++){
		test_case();
	}
	cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
 
	return 0;
}
