#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;

int main() {
	int N; cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; i++) cin >> A[i];
	int M; cin >> M;
	vector<int> B(M);
	for (int j = 0; j < M; j++) cin >> B[j];
	sort(B.begin(), B.end(), greater<int>());
	vector<P> dp(1<<N, P(M, 0));
	dp[0] = P(0, 0);
	for (int S = 0; S < (1<<N); S++)
		for (int i = 0; i < N; i++) {
			if (S & (1<<i)) continue;
			int j = dp[S].first, a = dp[S].second;
			if (j < M && a + A[i] <= B[j]) dp[S + (1<<i)] = min(dp[S + (1<<i)], P(j, a + A[i]));
			else if (j + 1 < M && A[i] <= B[j + 1]) dp[S + (1<<i)] = min(dp[S + (1<<i)], P(j + 1, A[i]));
		}
	int j = dp[(1<<N) - 1].first;
	cout << (j < M ? j + 1 : -1) << endl;
}