#include<bits/stdc++.h>
#define reg register
// #define int long long
inline int read(){
    reg int x=0,k=1; reg char ch=getchar();
    while (ch<'0'||ch>'9') (ch=='-')&&(k=-1),ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*k;
}
inline bool cmax(reg int &x,reg int y){return x<y?x=y,1:0;}
const int N=110;
int n,L,C[N],f[N][N][N];
std::vector<int> vc[N];
signed main(){
    L=read(); for (reg int i=1;i<=L;i++) C[i]=read();
    n=read(); for (reg int i=1;i<=n;i++) vc[read()].push_back(i);
    memset(f,-0x3f,sizeof(f));
    for (reg int i=0;i<=n+1;i++) f[0][0][i]=0;
    for (reg int i=1;i<L;i++){
        for (reg int j=0;j<=C[i];j++) for (reg int k=1;k<=n;k++)if (f[i-1][j][k]>=0){
            if (C[i]-j>vc[i].size()) continue;
            if (C[i]-j&&vc[i][C[i]-j-1]>k) continue; 
            for (reg int x=0;x+C[i]-j<=vc[i].size()&&x<=C[i+1];x++){
                reg int p=x+C[i]-j;
                if (p<vc[i].size()&&vc[i][p]<k) continue;
                // std::cerr<<"<< "<<x<<"\n";
                for (reg int y=(p?vc[i][p-1]:0);y<(p==vc[i].size()?n+1:vc[i][p]);y++){
                    // if (vc[i].size()-p==1) std::cerr<<"from "<<i<<" "<<j<<" "<<k<<" "<<"to "<<x<<" "<<y<<"\n";
                    cmax(f[i][x][y],f[i-1][j][k]+vc[i].size()-p);
                }
                cmax(f[i][x][n+1],f[i-1][j][k]);
            } 
        } 
        for (reg int j=0;j<=C[i];j++){
            for (reg int x=0;x<=vc[i].size()&&x<=C[i+1];x++) 
                for (reg int y=x?vc[i][x-1]:0;y<=n+1;y++) cmax(f[i][x][y],f[i-1][j][n+1]);
        }
    }
    reg int ans=0;
    for (reg int i=0;i<=n;i++){
        cmax(ans,f[L-1][C[L]][i]);
        // if (f[L-1][C[n]][i]==1) std::cerr<<"<< "<<i<<"\n";
    }
    for (reg int i=0;i<=C[L];i++){
        cmax(ans,f[L-1][i][n+1]);
        // if (f[L-1][i][n+1]==1) std::cerr<<"<< "<<i<<"\n";
    }
    printf("%d\n",ans);
    return 0;
}