#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
N = int(readline())
*A, = map(int, readline().split())
M = int(readline())
*B, = map(int, readline().split())


# %%
B.sort(reverse=True)

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


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

print(answer)