#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define rfr(i, n, m) for(int i = (n); i >= (m); i --)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1e9+7;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
const int mxn = 3e5+5;
mt19937 _rand(time(NULL));
clock_t z;
 
 

void solve(){
	int n;
	cin >> n;
	int a[n];
	fr(i, 0, n){
		cin >> a[i];
	}
	vector<int> v;
	fr(i, 0, n){
		int pt2 = 1;
		int num = a[i];
		for(int j = 2; j*j <= num; j ++){
			if(num % j == 0){
				int c = 0;
				while(num % j == 0){
					++c;
					num /= j;
				}
				if(c % 2){
					pt2 *= j;
				}
			}
		}
		if(num > 1) pt2 *= num;
		
		
		
		v.pb(pt2);
	}
	sort(all(v));
	int case0 = 1;
	int pre = -1;
	int cn = 0;
	
	int casen = 0;
	int oddgr = 0;
	
	
	for(auto u : v){
		if(u == pre){
			++cn;
		}
		else{
			if(pre != 1){			
				case0 = max(case0, cn);
				if(cn % 2){
					oddgr = max(oddgr, cn);	
				}
				else{
					casen += cn;
				}
			}
			else{
				case0 = max(case0, cn);
				casen += cn;
			}
			cn = 1;
			pre = u;
		}
	}
	if(pre != 1){			
		case0 = max(case0, cn);
		if(cn % 2){
			oddgr = max(oddgr, cn);	
		}
		else{
			casen += cn;
		}
	}
	else{
		case0 = max(case0, cn);
		casen += cn;
	}
	
	
	casen = max(casen, oddgr);
	
	int q;
	cin >> q;
	while(q--){
		ll w;
		cin >> w;
		if(w == 0){
			cout<<case0<<endl;
		}
		else{
			cout<<casen<<endl;
		}
	}
	
}
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	
	int tc = 1;
	cin >> tc;
	while(tc--){
		solve();
	}
 
}
