#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i=a; i<b; i++)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define fo(i, n) rep(i, 0, n)
#define F first
#define S second
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

vector<vi> dp;
vector<int> jmp;
vector<int> true_jmp;
vector<vector<bool>> allowed, ran;
vector<bool> par, letter;

int n, m0;
string s, r;

int run(int a, int b) {
	if (a == 0 && b == 0)
		return 0;
	if (a <= -1 || b <= -1)
		return -10000;
	if (ran[a][b]) return dp[a][b];
	ran[a][b] = true;


	int res = run(a-1, b);
	if (b >= 1 && true_jmp[b-1] != -1) {
		res = max(res, run(a, true_jmp[b-1]));
	}
	if (a >= 1 && b >= 1 && allowed[b-1][s[a-1]-'a']) {
		res = max(res, run(a-1, b-1)+1);
	}
	if (b >= 1 && par[b-1])
		res = max(res, run(a, b-1));

	dp[a][b] = res;
	cout << a << " " << b << " " << dp[a][b] << endl;
	return res;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	cin >> n >> s >> m0 >> r;

	vector<int> stack;
	int m = 0;
	for (int i=0; i<m0; i++) {
		par.PB(false);
		letter.PB(false);
		jmp.PB(m);
		true_jmp.PB(-1);
		allowed.PB(vector<bool>(26, false));
		if (r[i] == '(') {
			stack.push_back(m);
			par[m] = true;
		} else if (r[i] == ')') { 
			jmp[m] = stack.back();
			stack.pop_back();
			par[m] = true;
		} else if (r[i] == '[') {
			while (r[++i] != ']') {
				allowed[m][r[i] - 'a'] = true;
			}
			letter[m] = true;
		} else if (r[i] == '?') {
			for (int i=0; i<26; i++) {
				allowed[m][i] = true;
			}
			letter[m] = true;
		} else if (r[i] == '*') {
			true_jmp[m] = jmp[m-1];
			true_jmp[jmp[m-1]] = m;
			par[m] = true;
		} else {
			allowed[m][r[i] - 'a'] = true;
			letter[m] = true;
		}
		m++;
	}
	dp.resize(n+1, vi(m+1, -100000));
	ran.resize(n+1, vector<bool>(m+1));
	run(n, m);
	cout << max(-1, dp[n][m]) << endl;
}