#include <iostream>

#include <cstdlib>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cmath>

using namespace std;

const int MaxM = 50 + 5, MaxN = 1000 + 5;

int n, m, Ans, Rest, Need, Tot;

int A[MaxM], B[MaxN], Sum[MaxN];

bool DFS(int x, int y)

{

	if (Rest + Need > Tot) return false;

	bool ret = false;

	for (int i = y; i <= m; ++i)

	{

		if (A[i] >= B[x])

		{

			A[i] -= B[x];

			if (A[i] < B[1]) Rest += A[i];

			if (x == 1) ret = true;

			else if (B[x - 1] == B[x]) ret = DFS(x - 1, i);

			else ret = DFS(x - 1, 1);

			Rest -= A[i];

			A[i] += B[x];

			if (ret) return true;

		}

	}

	return false;

}

int main()

{

	scanf("%d", &m);

	for (int i = 1; i <= m; ++i) scanf("%d", &A[i]);

	scanf("%d", &n);

	for (int i = 1; i <= n; ++i) scanf("%d", &B[i]);

	sort(A + 1, A + m + 1);

	for (int i = 1; i <= m; ++i) Tot += A[i];

	sort(B + 1, B + n + 1);

	for (int i = 1; i <= n; ++i) Sum[i] = Sum[i - 1] + B[i];

	int l, r, mid;

	l = 0; r = n;

	Ans = 0;

	while (l <= r)

	{

		mid = (l + r) >> 1;

		Need = Sum[mid];

		Rest = 0;

		if (DFS(mid, 1))

		{

			Ans = mid;

			l = mid + 1;

		}

		else r = mid - 1;

	}

	printf("%d\n", Ans);

	return 0;

}