#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));
    // reg int now=0;
    for (reg int i=0;i<=n+1;i++) f[0][0][i]=0;
    for (reg int i=1;i<L;i++){
        // now^=1;
        for (reg int j=0;j<=C[i]&&j<=vc[i-1].size();j++) for (reg int k=0;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; 
            reg int pos=std::upper_bound(vc[i].begin(),vc[i].end(),k)-vc[i].begin()-1;
            for (reg int y=0,p=-1;y<=n+1;y++){
                while (p+1<vc[i].size()&&vc[i][p+1]<=y) p++;
                // std::cerr<<"<< "<<y<<" "<<p<<"\n";
                if (p<=pos-C[i]+j){
                    // if (vc[i].size()-1-p-(C[i]-j)==2) std::cerr<<"qwq\n";
                    cmax(f[i][pos-C[i]+j-p][y],f[i-1][j][k]+vc[i].size()-1-pos);
                }
                else if (p>pos) cmax(f[i][p+1-(C[i]-j)][y],f[i-1][j][k]+vc[i].size()-1-p);
                else cmax(f[i][pos+1-C[i]+j][y],f[i-1][j][k]+vc[i].size()-1-pos);
            }
            cmax(f[i][0][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]);
        }
        // for (reg int j=0;j<=C[i]&&j<=vc[i-1].size();j++) memset(f[now^1][j],-0x3f,n+2<<2);
    }
    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";
    }
    // std::cerr<<"<< "<<f[1][0][5]<<"\n";
    printf("%d\n",ans);
    return 0;
}