Let us call two integers x and y adjacent if (lcm(x, y))/(gcd(x, y)) is a perfect square. For example, 3 and 12 are adjacent, but 6 and 9 are not.

Here gcd(x, y) denotes the [greatest common divisor (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of integers x and y, and lcm(x, y) denotes the [least common multiple (LCM)](https://en.wikipedia.org/wiki/Least_common_multiple) of integers x and y.

You are given an array a of length n. Each second the following happens: each element a_i of the array is replaced by the product of all elements of the array (including itself), that are adjacent to the current value. 

Let d_i be the number of adjacent elements to a_i (including a_i itself). The beauty of the array is defined as max_{1 ≤ i ≤ n} d_i. 

You are given q queries: each query is described by an integer w, and you have to output the beauty of the array after w seconds.

Input

The first input line contains a single integer t (1 ≤ t ≤ 10^5) — the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 3 ⋅ 10^5) — the length of the array.

The following line contains n integers a_1, …, a_n (1 ≤ a_i ≤ 10^6) — array elements. 

The next line contain a single integer q (1 ≤ q ≤ 3 ⋅ 10^5) — the number of queries.

The following q lines contain a single integer w each (0 ≤ w ≤ 10^{18}) — the queries themselves.

It is guaranteed that the sum of values n over all test cases does not exceed 3 ⋅ 10^5, and the sum of values q over all test cases does not exceed 3 ⋅ 10^5

Output

For each query output a single integer — the beauty of the array at the corresponding moment.

Example

Input


2
4
6 8 4 2
1
0
6
12 3 20 5 80 1
1
1


Output


2
3

Note

In the first test case, the initial array contains elements [6, 8, 4, 2]. Element a_4=2 in this array is adjacent to a_4=2 (since (lcm(2, 2))/(gcd(2, 2))=2/2=1=1^2) and a_2=8 (since (lcm(8,2))/(gcd(8, 2))=8/2=4=2^2). Hence, d_4=2, and this is the maximal possible value d_i in this array.

In the second test case, the initial array contains elements [12, 3, 20, 5, 80, 1]. The elements adjacent to 12 are \{12, 3\}, the elements adjacent to 3 are \{12, 3\}, the elements adjacent to 20 are \{20, 5, 80\}, the elements adjacent to 5 are \{20, 5, 80\}, the elements adjacent to 80 are \{20, 5, 80\}, the elements adjacent to 1 are \{1\}. After one second, the array is transformed into [36, 36, 8000, 8000, 8000, 1].
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e6;
int prime[N + 1], fact[N + 1];
void sieve()
{
    prime[0] = prime[1] = 1;
    for(ll i = 2;i <= N;i++)
    {
        if(prime[i] == 0)
        {
        	fact[i] = -1;
            for(ll j = i * i;j <= N;j += i)
            {
                fact[j] = i;
                prime[j] = 1;
            }
        }
    }
}
int main()
{
	ios_base :: sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	sieve();
	while(t--)
	{
		ll n;
		cin >> n;
		map <ll, ll> mp;
		for(int i = 1;i <= n;i++)
		{
			ll val, trans = 1;
			cin >> val;
			map <ll, ll> temp;
			while((fact[val] != -1) && (val != 1))
			{
				temp[fact[val]]++;
				val = val / fact[val];
			}
			temp[val]++;
			for(auto it = temp.begin();it != temp.end();it++)
			{
				if(it -> second % 2)
					trans = trans * it -> first;
			}
			mp[trans]++;
		}
		ll ones = 0, mx = 1, mxx = 1;
		for(auto it = mp.begin();it != mp.end();it++)
		{
			if((it -> second % 2 == 0) && (it -> first != 1))
				ones += it -> second;
			else
				mxx = max(mxx, it -> second);
			mx = max(mx, it -> second);
		}
		mp[1] += ones;
		int q;
		cin >> q;
		for(int i = 1;i <= q;i++)
		{
			ll w;
			cin >> w;
			if(w == 0)
				cout << mx << "\n";
			else
				cout << max(mxx, mp[1]) << "\n";
		}
	}
	return 0;
}