N = int(input())
A = list(map(int,input().split()))
M = int(input())
B = list(map(int,input().split()))
B.sort(reverse=True)
S = [0] * (1<<N)
for bit in range(1<<N):
    for i in range(N):
        if bit & (1<<i):
            S[bit] += A[i]
DP = [[0] * (1<<N) for _ in range(M+1)]
DP[0][0] = 1
for i in range(M):
    for bit in range(1<<N):
        for bit2 in range(1<<N):
            if bit & bit2 == 0 and DP[i][bit] and S[bit2] <= B[i]:
                DP[i+1][bit|bit2] = 1
    if DP[i+1][(1<<N)-1]:
        print(i+1)
        exit()
print(-1)