import sys

sys.setrecursionlimit(10 ** 6)
# from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(bi=0,ai=-1,s=0,cnt=0):
        #print(bi,ai,s,cnt)
        if cnt==n:return bi
        if bi==m:
                return 100
        if ai+1==n or s+aa[ai+1]>bb[bi]:
            return dfs(bi+1,-1,0,cnt)
        res=100
        for i in range(ai+1,n):
            if s+aa[i]>bb[bi]:break
            if put[i]:continue
            put[i]=True
            ret=dfs(bi,i,s+aa[i],cnt+1)
            put[i]=False
            if ret<res:res=ret
        return res

    n=II()
    aa=LI()
    m=II()
    bb=LI()
    aa.sort()
    bb.sort(reverse=True)
    cap=sum(aa)
    put=[False]*n
    ans=dfs()+1
    if ans==101:print(-1)
    else:print(ans)

main()