#include<stdio.h>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;
string repr[100], v[100005];
int ls, n, maxim, lg;
char c, s[100005];


int main(){
   // freopen("a.in","r",stdin);
   // freopen("a.out","w",stdout);
    for (char c='a';c<='z';c++){
        gets(s);ls=strlen(s);
        for (int i=2;i<ls;i++)
            repr[c-'a'].push_back(s[i]);
    }
    scanf("%d\n",&n);
    for (int i=1;i<=n;i++){
        gets(s);    ls=strlen(s);
        for (int j=0;j<ls;j++)
            v[i].append(repr[s[j]-'a']);
    }
    sort(v+1,v+1+n);
    lg=1;   maxim=1;
    for (int i=2;i<=n;i++){
        if (v[i]==v[i-1])
            lg++;
        else
            lg=1;
        maxim=max(maxim,lg);
    }
    if (maxim>1)
        printf("%d\n",maxim);
    else
        printf("-1\n");
    
    return 0;
}