#include<bits/stdc++.h>
using namespace std;
const int N = 10000;
int k,ch[N][2],fail[N],cd[55][55],len[55],tot,que[N];
int cnt[55],coc[55],sum,s[1000005],n,alen,oc;
bool hs[N];
inline int rid(char c){
	if('A'<=c&&c<='Z')return c-'A';
	else if(c>='a'&&c<='z')return 26+c-'a';
	return -1;
}
int trv(int p,int nc){
	for(int i = 1,c;i<=len[nc];i++){
		c = cd[nc][i];
		p = ch[p][c];
		if(c)oc--;
		if(!hs[p])return -1;
	}
	return p;
}
void gfail(){
	int head = 1,tail = 0,p,v;
	for(int c:{0,1})if(ch[0][c])que[++tail] = ch[0][c];
	while(head<=tail){
		p = que[head++];
		for(int c:{0,1}){
			v = ch[p][c];
			if(!v){
				ch[p][c] = ch[fail[p]][c];
				continue;
			}
			fail[v] = ch[fail[p]][c];
			hs[v]|=hs[fail[v]];
			que[++tail] = v;
		}
	}
}
int main(){
	scanf("%d",&k);
	char rch = getchar();
	while(rid(rch)==-1)rch = getchar();
	while(~rid(rch)){
		s[++n] = rid(rch)+1;
		cnt[s[n]]++;
		rch = getchar();
	}
	bool fg[2] = {};
	for(int i = 1;i<=k;i++){
		while(!isdigit(rch))rch = getchar();
		while(isdigit(rch)){
			cd[i][++len[i]] = rch-'0';
			if(rch=='1')coc[i]++;
			rch = getchar();
		}
		if(len[i]==1)fg[cd[i][1]] = 1;
	}
//	for(int i = 1;i<=k;i++)printf("%d%c",cnt[i]," \n"[i==k]);
	for(int i = 1;i<=k;i++)alen+=cnt[i]*len[i],oc+=cnt[i]*coc[i];
	if(fg[0]&&fg[1]){
		printf("-1\n");
		return 0;
	}else if(!fg[0]&&!fg[1]){
		printf("%d\n",alen);
		return 0;
	}else if(fg[1]){
		oc = alen-oc;
		for(int i = 1;i<=k;i++)
			for(int j = 1;j<=len[i];j++)cd[i][j]^=1;
	}
	for(int i = 1,p;i<=k;i++){
		reverse(cd[i]+1,cd[i]+len[i]+1);
		p = 0;
		for(int j = 1,c;j<=len[i];j++){
			c = cd[i][j];
			if(!ch[p][c])ch[p][c] = ++tot;
			p = ch[p][c];
		}
		hs[p] = 1;
	}
	gfail();
	int p = 0;
	for(int i = n;i>=1;i--){
		p = trv(p,s[i]);
		if(p==-1){
			printf("%d\n",oc+1);
			return 0;
		}
	}
	printf("-1\n");
	return 0;
}