# Here your code !
n = gets.to_i
A = gets.split.map(&:to_i)
m = gets.to_i
B = gets.split.map(&:to_i).sort.reverse
S = 1 << n
DP = Array.new(S,-1)
ans = m.times.find do |j|
    DP[0] = B[j]
    S.times do |s|
        if DP[s] < 0
            DP[s] = n.times.select {|i| 
                mask = 1 << i
                mask & s > 0 && DP[s ^ mask] > 0
            }.map {|i|
                mask = 1 << i
                DP[ s ^ mask ] - A[i]
            }.max || -1
        else
            DP[s] = B[j]
        end
    end
    DP[S-1] >= 0
end
puts ans.nil? ? -1 : ans + 1