import sys

n = int(input())
a = list(map(int, input().split()))
m = int(input())
b = list(map(int, input().split()))
b.sort(reverse=True)

dp1 = [False] * (1 << 10)
dp2 = [False] * (1 << 10)

dp1[0] = True

for i in range(m):
    for j in range(1 << n):
        c = 0
        for k in range(n):
            if (j >> k) % 2 == 0:
                continue
            c += a[k]
        if c > b[i]:
            continue
        
        for k in range((1 << n) - 1, -1, -1):
            dp2[j | k] |= dp1[k]
            
    for k in range((1 << n) - 1, -1, -1):
        dp1[k] = dp2[k]
    if dp1[(1 << n) - 1]:
        print(i + 1)
        sys.exit(0)
       
print(-1)