#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int n, m, a[15], b[15], dp[15][1<<10], ok[15][1<<10];

int main(){
    scanf("%d", &n);
    rep(i, n) scanf("%d", &a[i]);
    scanf("%d", &m);
    rep(i, m) scanf("%d", &b[i]);
    sort(b, b+m, greater<>());

    rep(i, m)rep(S, 1<<n){
        int sum = 0;
        rep(j, n)if(S>>j & 1) sum += a[j];
        ok[i][S] = (sum <= b[i]);
    }
    dp[0][0] = 1;
    rep(i, m)rep(S, 1<<n)if(dp[i][S]){
        rep(T, 1<<n)if(ok[i][T]) dp[i+1][S|T] = 1;
    }

    rep(i, m+1)if(dp[i][(1<<n)-1]){
        printf("%d\n", i);
        return 0;
    }
    puts("-1");
}