import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline

N=int(readline())
*A,=map(int,readline().split())
M=int(readline())
*B,=map(int,read().split())
B.sort(reverse=True)

sum_size=[0]
for x in A:
  sum_size+=[x+y for y in sum_size]

full=1<<N
dp=[0]*full
dp[0]=1
ans=-1
for n, box_size in enumerate(B,1):
  ndp=[0]*full
  for i in range(1<<N):
    j=i
    while True:
      if sum_size[j]<=box_size and dp[i^j]:
        ndp[i]=1
        break
      if not j: break
      j=(j-1)&i
  dp=ndp
  if dp[-1]:
    ans=n
    break

print(ans)