#include <bits/stdc++.h>
using namespace std;

void solve(){
    int N;cin>>N;
    vector<int>A(N);
    for(auto&x:A) cin>>x;
    int M;cin>>M;
    vector<int> B(M);
    for(auto&x:B)cin>>x;
    sort(B.rbegin(),B.rend());

    int full=1<<N;
    vector<int> toy_sub(full);
    for(int mask=1;mask<full;++mask){
        int last_bit=mask&-mask;
        int i=__builtin_ctz(last_bit);
        toy_sub[mask]=toy_sub[mask^last_bit]+A[i];
    }

    vector<bool> dp(1<<N);
    dp[0]=true;
    int ans=-1;
    for(int n=1;n<=M;++n){
        vector<bool> ndp(1<<N);
        for(int s=0;s<full;++s){
            int j=s;
            while(1){
                if(toy_sub[j]<=B[n-1] && dp[s^j]){
                    ndp[s]=1;
                    break;
                }
                if(!j)break;
                j=(j-1)&s;
            }
        }
        dp=ndp;
        if(dp.back()){
            ans=n;
            break;
        }
    }
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}