#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18
#define mod 998244353

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll n, Q;
ll a[200005];
vector<ll> vec;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	rep(i, 1, n) cin >> a[i];
	
	ll mask = 0; bool none = false;
	for(int i = n; i >= 1; i--){
		ll x = ~mask & a[i];
		if(x > 0) vec.push_back(x);
		mask |= x;
		if(i == 1 && x > 0) none = true;
	}
	mask = ~mask;
	
	cin >> Q;
	ll b;
	rep(i, 1, Q){
		cin >> b;
		ll ans = 0;
		for(auto x : vec){
			bool flag[2] = {};
			rep(j, 0, 59){
				if(x & (1LL<<j)) flag[((b>>j)+ans)&1] = true;
			}
			if(flag[0] && flag[1]) ans = inf;
			if(flag[0]) ans++;
		}
		
		bool flag[2] = {};
		rep(j, 0, 59){
			if(mask & (1LL<<j)) flag[((b>>j)+ans)&1] = true;
		}
 		if(flag[0] && flag[1]) ans = inf;
		if(flag[1]){
			if(none) ans = inf;
			ans++;
		}
		
		if(ans > inf/2) ans = -1;
		cout << ans << "\n";
		end:;
	}
	flush(cout);
	
	return 0;
}