#include <bits/stdc++.h>
#include <cassert>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
void shuf(vector<T>& a) {
    for (int i = 1; i < sz(a); i++) swap(a[i], a[rnd() % (i + 1)]);
}

void solve() {
    int l; cin >> l;
    vector<int> c(l);
    for (int i = 0; i < l; i++) cin >> c[i];
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<vector<int>> guys(l - 1);
    for (int i = 0; i < n; i++) guys[a[i] - 1].pb(i);

    int ans = 0;
    for (int mask = 1; mask < (1 << n); mask++) {
        //if ((mask >> 0) & 1) continue;
        vector<int> time(l, 1e9);
        for (int i = 0; i < n; i++) {
            if ((mask >> i) & 1) {
                time[a[i] - 1] = min(time[a[i] - 1], i - 1);
                time[a[i]] = min(time[a[i]], i - 1);
            }
        }
        vector<int> used(n);
        bool good = true;
        if (time[0] != 1e9) {
            int mg = -1;
            for (int guy : guys[0]) {
                if (guy <= time[0] && !((mask >> guy) & 1)) mg = guy;
            }
            if (mg == -1) {
                good = false;
            }
            else used[mg] = 1;
        }
        vector<bool> bitt(n);
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            bitt[i] = ((mask >> i) & 1);
            cnt += bitt[i];
        }
        for (int i = 1; i < l; i++) {
            if (time[i] == 1e9) continue;
            bool found = false;
            for (int guy : guys[i - 1]) {
                if (guy <= time[i] && !used[guy] && !bitt[guy]) {
                    found = true;
                }
            }
            if (!found) {
                if (i == l - 1) {
                    good = false; break;
                }
                int mg = -1;
                for (int guy : guys[i]) {
                    if (guy <= time[i] && !bitt[guy]) mg = guy;
                }
                if (mg == -1) {
                    good = false;
                } else used[mg] = 1;
            }
        }
        if (good) ans = max(ans, cnt);
    }
    
    cout << ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false);
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}