#2WA求调

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 0721;
int tr[N][26], ed[N], fail[N], tot;

void insert(string s) {
	int u = 0;
	for (int i = 0; i < s.length(); ++i) {
		if (!tr[u][s[i] - 'a'])
			tr[u][s[i] - 'a'] = ++tot;
		u = tr[u][s[i] - 'a'];
	}
	++ed[u];
}

queue<int> q;
void build(void) {
	for (int i = 0; i < 26; ++i) {
		if (tr[0][i]) q.push(tr[0][i]);
	}
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = 0; i < 26; ++i) {
			if (tr[u][i]) {
				fail[tr[u][i]] = tr[fail[u]][i];
				q.push(tr[u][i]);
			} else
				tr[u][i] = tr[fail[u]][i];
		}
	}
}

int query(string s) {
	int res = 0, u = 0;
	for (int i = 0; i < s.length(); ++i) {
		u = tr[u][s[i] - 'a'];
		for (int j = u; j && ed[j] != -1; j = fail[j]) {
			res += ed[j];
			ed[j] = -1;
		}
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		string s;
		cin >> s;
		insert(s);
	}
	
	string s;
	cin >> s;
	cout << query(s);
	
	return 0;
}