import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum E = 60; void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } const Q = readInt(); auto B = new long[Q]; foreach (q; 0 .. Q) { B[q] = readLong(); } auto prev = new int[E][N + 1]; prev[0][] = -1; foreach (i; 0 .. N) { prev[i + 1][] = prev[i][]; foreach (e; 0 .. E) { if ((A[i] >> e) & 1) { prev[i + 1][e] = i; } } } foreach (q; 0 .. Q) { int ans; long mask = (1L << E) - 1; long tar = B[q]; for (int i = N; ; ) { int jm = -1; foreach (e; 0 .. E) { if ((mask >> e) & 1) { chmax(jm, prev[i][e]); } } if (jm == -1) { if (!(~tar & mask)) { if (i == 0) { ans = -1; } else { ++ans; } } else if (!tar) { // OK } else { ans = -1; } break; } else { const force = A[jm] & mask; debug { writefln("i = %s, mask = %s, tar = %s: jm = %s, force = %s", i, mask, tar, jm, force); } if (!(~tar & force)) { mask &= ~force; tar = tar & mask; } else if (!(tar & force)) { ++ans; mask &= ~force; tar = ~tar & mask; } else { ans = -1; break; } i = jm; } } writeln(ans); } debug { foreach (i; 0 .. N) { writefln("%60b %20s", A[i], A[i]); } foreach (p; 0 .. 1 << N) { long x; foreach (i; 0 .. N) { x |= A[i]; if (p & 1 << i) { x ^= (1L << E) - 1; } } writefln("%0*b %s: %60b %20s", N, p, popcnt(p), x, x); } } } } catch (EOFException e) { } }