#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool dp[1 << 10];
int sum[1 << 10], a[10], b[10];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) sum[i] += a[j];
        }
    }
    int m;
    cin >> m;
    for (int i = 0; i < m; i++) cin >> b[i];
    sort(b, b + m, greater<int>());
    dp[0] = true;
    for (int i = 0; i < m; i++) {
        for (int j = (1 << n) - 2; j >= 0; j--) {
            if (!dp[j]) continue;
            for (int k = (1 << n) - 1; k > 0; k--) {
                if (j & k) continue;
                if (b[i] < sum[k]) continue;
                dp[j | k] = true;
                if ((j | k) == (1 << n) - 1) {
                    cout << i + 1 << endl;
                    return 0;
                }
            }
        }
    }
    cout << -1 << endl;
    return 0;
}