def calc(n, adj=0):
    ret = 0
    f = adj
    for e in E:
        if n ^ e < n:
            n ^= e
            ret += f
            f = 0
        else:
            ret += f ^ 1
            f = 1
    ret += f
    return 100 if n else ret

N = int(input())
A = [int(a) for a in input().split()]

m = (1 << 60) - 1
s = m
E = []
for a in A[1:][::-1]:
    t = s & a
    for e in E:
        t = min(t, t ^ e)
    if t: E.append(t)
    s &= a ^ m

s &= A[0]
Q = int(input())
L = [int(a) for a in input().split()]
for b in L:
    t = min(calc(b ^ s), calc(b ^ s ^ m, 1))
    print(-1 if t > 99 else t)

assert 1 <= N <= 200000
assert len(A) == N
for a in A:
    assert 0 <= a < 1 << 60
assert 1 <= Q <= 200000
assert len(L) == Q
for b in L:
    assert 0 <= b < 1 << 60