#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#define mp make_pair
#define pb push_pack
#define LL long long
#define inf 2e9
#define zeros x^(x-1)&x
#define MOD1 10007
#define MOD2 10071
using namespace std;

int n,x,mx;
map<string, int> M;
char C;
string c[255],s;
string cuv;

int main()
{
    for (int i=1;i<=26;i++)
    {
        cin>>C;
        cin>>c[C];
    }

    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>s;
        cuv.clear();
        for (int j=0;j<s.size();j++)
        {
            for (int k=0;k<c[s[j]].size();k++)
                cuv.push_back(c[s[j]][k]);
        }
        int x = M[cuv];
        M[cuv] = x+1;
        if (x+1>mx)
            mx = x+1;
    }

    cout<<mx;

    return 0;
}