#include <cstdio>

#define FOR(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define REV(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define INC(i, n) FOR(i, 0, n)
#define DEC(i, n) REV(i, 0, n)
#define INC1(i, n) FOR(i, 1, (n) + 1)
#define DEC1(i, n) REV(i, 1, (n) + 1)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void m_sort_(T a[], T b[], int l, int r) {
	if(r - l < 2) { return; }
	
	int m = (l + r) / 2;
	m_sort_(a, b, l, m);
	m_sort_(a, b, m, r);
	
	int ll = l, rr = m, bb = 0;
	while(bb < r - l) {
		bool flag;
		if(rr == r || ll == m) { flag = (rr == r); }
		else { flag = (a[ll] >= a[rr]); }
		
		if(flag) { b[bb++] = a[ll++]; }
		else     { b[bb++] = a[rr++]; }
	}
	
	FOR(i, l, r) { a[i] = b[i - l]; }
	
	return;
}
template<typename T> void m_sort(T a[], int l, int r) {
	T* b = new T[r - l];
	m_sort_(a, b, l, r);
	delete[] b;
	
	return;
}


int n, m, a[10], b[10];

int search() {
	INC1(i, m) {
		if(n <= 0) { return i; } else { INC(c0, i) { b[c0] -= a[0]; if(b[c0] >= 0) {
		if(n <= 1) { return i; } else { INC(c1, i) { b[c1] -= a[1]; if(b[c1] >= 0) {
		if(n <= 2) { return i; } else { INC(c2, i) { b[c2] -= a[2]; if(b[c2] >= 0) {
		if(n <= 3) { return i; } else { INC(c3, i) { b[c3] -= a[3]; if(b[c3] >= 0) {
		if(n <= 4) { return i; } else { INC(c4, i) { b[c4] -= a[4]; if(b[c4] >= 0) {
		if(n <= 5) { return i; } else { INC(c5, i) { b[c5] -= a[5]; if(b[c5] >= 0) {
		if(n <= 6) { return i; } else { INC(c6, i) { b[c6] -= a[6]; if(b[c6] >= 0) {
		if(n <= 7) { return i; } else { INC(c7, i) { b[c7] -= a[7]; if(b[c7] >= 0) {
		if(n <= 8) { return i; } else { INC(c8, i) { b[c8] -= a[8]; if(b[c8] >= 0) {
		if(n <= 9) { return i; } else { INC(c9, i) { b[c9] -= a[9]; if(b[c9] >= 0) {
			return i;
		} b[c9] += a[9]; } }
		} b[c8] += a[8]; } }
		} b[c7] += a[7]; } }
		} b[c6] += a[6]; } }
		} b[c5] += a[5]; } }
		} b[c4] += a[4]; } }
		} b[c3] += a[3]; } }
		} b[c2] += a[2]; } }
		} b[c1] += a[1]; } }
		} b[c0] += a[0]; } }
	}
	
	return -1;
}

int main() {
	scanf("%d", &n);
	INC(i, n) { scanf("%d", &a[i]); }
	scanf("%d", &m);
	INC(i, m) { scanf("%d", &b[i]); }
	
	m_sort(b, 0, m); // 降順
	
	printf("%d\n", search() );
	
	return 0;
}