#include<bits/stdc++.h>
#define ll long long
#define deb(x) cerr<<"deb:"<<__LINE__<<" "<<#x<<"="<<x<<"\n"
//#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
using namespace std;
//char buf[1<<21],*p1=buf,*p2=buf;
inline ll read()
{
	ll sum=0,l=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')l=-1;c=getchar();}
	while(isdigit(c)){sum=(sum<<1)+(sum<<3)+(c^48);c=getchar();}
	return sum*l;
}
const int inf=1e9;
string s[110];
ll b[200100],p[310],szz[110];
struct Node
{
	ll ch[200100][2],fail[200100],r[200100],cnt;
	void Add(string s)
	{
		ll sz=s.size(),x=0;
		for(ll i=0;i<sz;i++)
		{
			ll &now=ch[x][s[i]-'0'];
			if(!now)now=++cnt,r[now]=inf;
			x=now;
		}
		r[x]=sz;
	}
	void Build()
	{
		r[0]=inf;
		queue<ll> q;
		for(ll i=1;i<=2;i++)
		{
			if(ch[0][i-1])
			{
				q.push(ch[0][i-1]);
				fail[ch[0][i-1]]=0;
			}
		}
		while(!q.empty())
		{
			ll x=q.front();
			q.pop();
			r[x]=min(r[x],r[fail[x]]);
			for(ll i=1;i<=2;i++)
			{
				ll &y=ch[x][i-1];
				if(!y)y=ch[fail[x]][i-1];
				else fail[y]=ch[fail[x]][i-1],q.push(y);
			}
		}
	}
}tr;
int main()
{
	for(ll i=1;i<=26;i++)
	{
		p['A'+i-1]=i;
	}
	for(ll i=1;i<=26;i++)
	{
		p['a'+i-1]=i+26;
	}
	ll a=read(),al=0;
	string t;
	cin>>t;
	ll sz=t.size(),sl=-1;
	for(ll i=1;i<=a;i++)
	{
		cin>>s[i];
		szz[i]=s[i].size();
		if(szz[i]==1)sl=('1'-s[i][0]);
		reverse(s[i].begin(),s[i].end());
		tr.Add(s[i]);
	}
	for(ll i=1;i<=sz;i++)
	{
		al+=szz[p[t[i-1]]];
	}
	if(sl==-1)
	{
		cout<<al;
		return 0;
	}
	tr.Build();
	ll now=0,cnt=0,fl=0,ans=-1;
	for(ll i=sz;i>=1;i--)
	{
		for(ll j=1;j<=szz[p[t[i-1]]];j++)
		{
			if(!fl)
			{
				now=tr.ch[now][s[p[t[i-1]]][j-1]-'0'];
				if(tr.r[now]>=inf)fl=1,ans=1;
			}
			else if(s[p[t[i-1]]][j-1]-'0'==sl)ans++;
		}
	}
	cout<<ans;
	return 0;
}