#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve();

int main() {
#ifndef LOCAL
	cin.tie(nullptr)->sync_with_stdio(false);
#endif
	cout << fixed << setprecision(30);
	int t = 1;
	// cin >> t;
	while (t--) {
		solve();
	}
}

constexpr int N = 8080;
int c[N], a[N], ans[N][N], dp[N];
vector<int> cnt[N], lft[N], rgt[N];

void solve() {
	int l;
	cin >> l;
	c[0] = N;
	c[l + 1] = N;
	for (int i = 1; i <= l; i++) {
		cin >> c[i];
	}
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		cnt[a[i]].push_back(i);
	}
	for (int i = 0; i <= l; i++) {
		for (int j = 0; j <= l + 1; j++) {
			lft[j].clear();
			rgt[j].clear();
		}
		ans[i][i + 1] = 0;
		for (int k : cnt[i]) {
			if (rgt[i].size() < c[i + 1]) {
				rgt[i].push_back(k);
			} else {
				lft[i].push_back(k);
			}
		}
		for (int j = i + 2; j <= l + 1; j++) {
			ans[i][j] = ans[i][j - 1];
			for (int k : cnt[j - 1]) {
				if (rgt[j - 2].size() + lft[j - 1].size() < c[j - 1]) {
					lft[j - 1].push_back(k);
				} else if (rgt[j - 1].size() < c[j]) {
					rgt[j - 1].push_back(k);
				} else if (!rgt[j - 2].empty() && rgt[j - 2].back() > k) {
					lft[j - 1].push_back(k);
					int nw = rgt[j - 2].back(), nwi = j - 2;
					rgt[j - 2].pop_back();
					while (nwi > i && !rgt[nwi - 1].empty() && rgt[nwi - 1].back() > nw) {
						lft[nwi].push_back(nw);
						nw = rgt[nwi - 1].back();
						rgt[nwi - 1].pop_back();
						nwi--;
					}
					if (nwi != i) {
						ans[i][j]++;
					}
				} else {
					ans[i][j]++;
				}
			}
		}
	}
	dp[0] = 0;
	dp[1] = 0;
	for (int i = 2; i <= l + 1; i++) {
		dp[i] = 0;
		for (int j = i - 1; j >= 0; j--) {
			dp[i] = max(dp[i], dp[j] + ans[j][i]);
		}
	}
	cout << dp[l + 1] << '\n';
}