#include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 int m,n;

 int re[];

 int a[],b[];

 int sum,ned;

 int waste=;

 bool dfs(int now,int st) {

     if(now==) return ;

     if(waste+ned>sum) return ;

     for(int i=st;i<=m;i++) {

         if(a[i]>=b[now])

         {

             a[i]-=b[now];

             if(a[i]<b[]) waste+=a[i];

             if(b[now]==b[now-]) {if(dfs(now-,i)) return ;}

             else if(dfs(now-,)) return ;

             if(a[i]<b[]) waste-=a[i];

             a[i]+=b[now];

         }

     }

     return ;

 }

 bool check(int mid) {

     ned=;waste=;

     for(int i=;i<=mid;i++) ned+=b[i];

     for(int i=;i<=m;i++) a[i]=re[i];

     return dfs(mid,);

 }

 int main() {

     scanf("%d",&m);

     for(int i=;i<=m;i++){scanf("%d",&re[i]);sum+=re[i];}

     scanf("%d",&n);

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

     sort(a+,a+m+);

     sort(b+,b+n+);

     int l=,r=n;

     while(l<=r) {

         int mid=(l+r)>>;

         if(check(mid)) l=mid+;

         else r=mid-;

     }

     printf("%d",l-);

 }