#include <bits/stdc++.h>
using namespace std;
int i,n,nr,sol,j;
char lit;
map <char,string> M;
string s,S[1<<17];
bool cmp(string a,string b)
{
    if(a.size()!=b.size()) return a.size()<b.size();
    for(int i=0;i<(int)a.size();++i)
        if(a[i]!=b[i]) return a[i]<b[i];
    return 0;
}
int main()
{
    for(i=1;i<=26;++i)
    {
        cin>>lit>>s;
        M[lit]=s;
    }
    cin>>n;
    for(i=1;i<=n;++i)
    {
        cin>>s;
        for(j=0;j<(int)s.size();++j) S[i]+=M[s[j]];
    }
    sort(S+1,S+n+1,cmp);
    nr=sol=1;
    for(i=2;i<=n;++i,sol=max(sol,nr))
        if(S[i-1]==S[i]) ++nr;
        else nr=1;
    if(sol==1) sol=-1;
    cout<<sol;
    return 0;
}