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

// #define int long long
using ll= long long;
#define fo(i,b) for(int i = (0); i < (b); ++i)
#define f(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,a,b) for(int i = (a); i < (b); ++i)
typedef pair<int, int> pii;
typedef vector<int> vi;

const int NMAX = 112345;
const int PMAX = 17;

bool valid[1<<PMAX];

char sche[NMAX];

#define D if(0)

int load()
{
		char in [1000];
		int inn=0;
		scanf("%s", in);
		for(int j=0;in[j];j++) inn |= 1<<(in[j]-'a');
		return inn;
}

int counts[NMAX];
int mask(){
	int r=0;
	fo(i,PMAX) r+= !!counts[i]<<i;
	return r;
}

signed main() {
	int n;
	scanf("%d", &n);
	fo(i,n) valid[load()]=1;
	scanf("%s", sche);
	int l = strlen(sche);

	fo(i,1<<PMAX) fo(j,PMAX) valid[i|(1<<j)] |= valid[i];

	ll out=0;
	int j=0;
	fo(i,l)
	{
		while(j<l && !valid[mask()])
		{
			counts[sche[j++]-'a']++;
		}
		D printf("%d %d\n", i,j);
		out += l-j + valid[mask()];
		counts[sche[i]-'a']--;
	}
	printf("%lld\n", out);
}