#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;}
inline int min(reg int x,reg int y){return x<y?x:y;}
inline int max(reg int x,reg int y){return x>y?x:y;}
const int N=8010;
int n,L,C[N],f[2][N][N],pre[N][N],suf[N][N],sum[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++){
        if (C[1]!=0&&(C[1]>vc[1].size()||vc[1][C[1]-1]>i)) continue;
        f[0][0][i]=0;
    }
    f[0][0][n+1]=0;
    memset(pre,-0x3f,sizeof(pre)),memset(suf,-0x3f,sizeof(suf));
    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+1;k++) sum[j][k]=f[now^1][j][k];
            for (reg int k=1;k<=n+1;k++) cmax(sum[j][k],sum[j][k-1]);
        }
        for (reg int x=0;x<=C[i+1]&&x<=vc[i].size();x++) for (reg int k=0;k<=n;k++){
            reg int p=std::upper_bound(vc[i].begin(),vc[i].end(),k)-vc[i].begin()-1;
            // if (p!=vc[i].size()-1) std::cerr<<"<< "<<i<<"\n";
            if (p+1>=x) cmax(suf[x][k],f[now^1][max(0,C[i]-(p+1-x))][k]+vc[i].size()-1-p);
        }
        for (reg int y=0;y<=n+1;y++) for (reg int j=0;j<=C[i]&&j<=vc[i-1].size();j++){
            reg int p=std::upper_bound(vc[i].begin(),vc[i].end(),y)-vc[i].begin()-1;
            // if (y==n+1) std::cerr<<i<<" "<<j<<" "<<sum[j][y]<<"\n";
            if (C[i]-j<=p+1) cmax(f[now][min(p+1-(C[i]-j),C[i+1])][y],sum[j][y]+vc[i].size()-1-p);
        }
        for (reg int j=0;j<=C[i]&&j<=vc[i].size();j++){
            for (reg int x=0;x<=vc[i].size()&&x<=C[i+1];x++)
                cmax(pre[x][x?vc[i][x-1]:0],f[now^1][j][n+1]);
            memset(f[now^1][j],-0x3f,sizeof(f[now^1][j]));
        }
        for (reg int x=0;x<=C[i+1]&&x<=vc[i].size();x++){
            for (reg int y=1;y<=n+1;y++) cmax(pre[x][y],pre[x][y-1]);
            for (reg int y=n;y>=0;y--) cmax(suf[x][y],suf[x][y+1]);
            for (reg int y=0;y<=n;y++)if ((x?vc[i][x-1]:0)<=y){
                if (C[i+1]!=x&&(C[i+1]-x>vc[i+1].size()||vc[i+1][C[i+1]-x-1]>y)){
                    f[now][x][y]=-1e9; 
                    continue;
                }
                cmax(f[now][x][y],pre[x][y]),cmax(f[now][x][y],suf[x][y]);
            }
            cmax(f[now][x][n+1],pre[x][n+1]),cmax(f[now][x][n+1],suf[x][n+1]);       
            memset(pre[x],-0x3f,sizeof(pre[x])),memset(suf[x],-0x3f,sizeof(suf[x]));
        } 
    }
    reg int ans=0;
    for (reg int i=0;i<=n;i++) cmax(ans,f[now][C[L]][i]);
    for (reg int i=0;i<=C[L];i++) cmax(ans,f[now][i][n+1]);
    printf("%d\n",ans);
    return 0;
}