#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+10;

int k;
char ala[maxn],s[52][53],S[maxn*52];

struct{
	int p,s[2];
}t[52*52+1];
int tot,edl[52*52+1],maxmatch[maxn*52];

int q[52*52+1],hd,tl;

void ins(char*S){
	int n=strlen(S),u=0;
	for(int i=n;~--i;){
		if(!t[u].s[S[i]-'0'])t[u].s[S[i]-'0']=++tot;
		u=t[u].s[S[i]-'0'];
	}edl[u]=n;
}
void build(){
	hd=1,tl=0;
	for(int i:{0,1})
		if(t[0].s[i])q[++tl]=t[0].s[i];
	while(hd<=tl){
		int u=q[hd++];
		for(int i:{0,1}){
			if(!t[u].s[i])t[u].s[i]=t[u].p[t].s[i];
			else q[++tl]=t[u].s[i],t[u].s[i][t].p=t[u].p[t].s[i],edl[t[u].s[i]]=max(edl[t[u].s[i]],edl[t[u].s[i][t].p]);
		}
	}
}

signed main() {
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>k>>(char(&)[maxn])ala[1];
	for(int i=0;i<k;++i)cin>>(char(&)[maxn])s[i],ins(s[i]);
	build();
	int n=0;
	for(int i=1;ala[i];++i){
		int id=isupper(ala[i])?ala[i]-'A':ala[i]-'a'+26;
		for(int j=0;s[id][j];++j)S[++n]=s[id][j];
	}
	// deb(S+1);
	int u=0;
	int ans=0;//,ned=0;
	for(int i=n;i;--i){
		u=t[u].s[S[i]-'0'];
		// deb(i,u,edl[u],S[i]);
		if(!edl[u] || (ans && edl[u]!=1))++ans,u=0;//,deb(i);
		// maxmatch[i]=edl[u];
	}
	cout<<(ans?:-1);
}