#include <iostream>
#include <vector>

constexpr int INF = 1 << 30;

void solve() {
    int n;
    std::cin >> n;
    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    std::vector<int> dp(1 << n, INF);
    dp[0] = 0;

    int m;
    std::cin >> m;
    while (m--) {
        int y;
        std::cin >> y;

        auto ndp = dp;
        for (int b = 0; b < (1 << n); ++b) {
            int sum = 0;
            for (int i = 0; i < n; ++i) {
                if ((b >> i) & 1) sum += xs[i];
            }
            if (sum > y) continue;

            for (int c = 0; c < (1 << n); ++c) {
                if ((b & c) != 0) continue;
                ndp[b | c] = std::min(ndp[b | c], dp[c] + 1);
            }
        }
        dp = ndp;
    }

    int ans = dp[(1 << n) - 1];
    std::cout << (ans == INF ? -1 : ans) << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}