#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

int main() {
	int n, m;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	cin >> m;
	vector<int> b(m);
	for (int i = 0; i < m; ++i) {
		cin >> b[i];
	}
	sort(b.begin(), b.end(), greater<int>());
	static bool possibles[10 + 1][1 << (10 + 1)] = { false };
	possibles[0][0x0] = true;
	int result = -1;
	for (int i = 1; i <= m; ++i) {
		for (int s = 0x0; s < (1 << n); ++s) {
			bool possible = false;
			for (int t = 0x0; t < (1 << n); ++t) {
				if ((t | s) != s) {
					continue;
				}
				if (possibles[i - 1][s ^ t]) {
					int volume = 0;
					for (int bits = t, k = 0; bits > 0; bits >>= 1, ++k) {
						if (bits & 0x1) {
							volume += a[k];
						}
					}
					if (volume <= b[i - 1]) {
						possible = true;
						break;
					}
				}
			}
			possibles[i][s] = possible;
		}
		if (possibles[i][(1 << n) - 1]) {
			result = i;
			break;
		}
	}
	cout << result << endl;
	return 0;
}