#include <cstdio>
#include <algorithm>
#include <functional>

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


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

#define S(x) if(n <= x) { return i; } else { INC(c##x, i) { b[c##x] -= a[x]; if(b[c##x] >= 0) {
#define E(x) } b[c##x] += a[x]; } }

int search() {
	INC1(i, m) {
		S(0)
		S(1)
		S(2)
		S(3)
		S(4)
		S(5)
		S(6)
		S(7)
		S(8)
		S(9)
			return i;
		E(9)
		E(8)
		E(7)
		E(6)
		E(5)
		E(4)
		E(3)
		E(2)
		E(1)
		E(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]); }
	
	std::sort(b, b + m, std::greater<int>() ); // 降順ソート
	
	printf("%d\n", search() );
	
	return 0;
}