#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int n, m;
int a[10], b[10];
int e[10][1024];
int exi[11][1024];
int main() {
	cin >> n;
	rep(i, n) {
		cin >> a[i];
	}
	cin >> m;
	rep(i, m) {
		cin >> b[i];
	}
	sort(b, b + m, greater<int>());
	rep(i, m) {
		rep(j, (1 << n)) {
			int sum = 0;
			rep(k, n) {
				if (j&(1 << k)) {
					sum += a[k];
				}
			}
			if (sum <= b[i]) {
				e[i][j] = 1;
			}
		}
	}
	exi[0][0] = 1;
	rep(i, m) {
		rep(j, 1 << n) {
			rep(k, 1 << n) {
				if (!exi[i][j] || !e[i][k])continue;
				exi[i + 1][j | k] = 1;
			}
		}
	}
	int out = -1;
	per(i, m+1) {
		if (exi[i][(1 << n) - 1])out = i;
	}
	cout << out << endl;
	return 0;
}